default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShunhua Jiang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i11]Deeksha Adil, Shunhua Jiang, Rasmus Kyng:
Acceleration Meets Inverse Maintenance: Faster ℓ∞-Regression. CoRR abs/2409.20030 (2024)- 2023
- [j3]Shunhua Jiang, Bento Natura, Omri Weinstein:
A Faster Interior-Point Method for Sum-of-Squares Optimization. Algorithmica 85(9): 2843-2884 (2023) - [j2]Yi-Jun Chang
, Ran Duan, Shunhua Jiang:
Near-Optimal Time-Energy Tradeoffs for Deterministic Leader Election. ACM Trans. Algorithms 19(4): 33:1-33:23 (2023) - [c10]Shunhua Jiang, Binghui Peng, Omri Weinstein:
The Complexity of Dynamic Least-Squares Regression. FOCS 2023: 1605-1627 - 2022
- [j1]Yaonan Jin, Shunhua Jiang, Pinyan Lu, Hengjie Zhang:
Tight Revenue Gaps among Multiunit Mechanisms. SIAM J. Comput. 51(5): 1535-1579 (2022) - [c9]Shunhua Jiang, Yunze Man, Zhao Song, Zheng Yu, Danyang Zhuo:
Fast Graph Neural Tangent Kernel via Kronecker Sketching. AAAI 2022: 7033-7041 - [c8]Baihe Huang, Shunhua Jiang, Zhao Song, Runzhou Tao, Ruizhe Zhang:
Solving SDP Faster: A Robust IPM Framework and Efficient Implementation. FOCS 2022: 233-244 - [c7]Shunhua Jiang, Bento Natura, Omri Weinstein:
A Faster Interior-Point Method for Sum-Of-Squares Optimization. ICALP 2022: 79:1-79:20 - [c6]Yi-Jun Chang, Shunhua Jiang:
The Energy Complexity of Las Vegas Leader Election. SPAA 2022: 75-86 - [i10]Shunhua Jiang, Binghui Peng, Omri Weinstein:
Dynamic Least-Squares Regression. CoRR abs/2201.00228 (2022) - [i9]Shunhua Jiang, Bento Natura, Omri Weinstein:
A Faster Interior-Point Method for Sum-of-Squares Optimization. CoRR abs/2202.08489 (2022) - [i8]Yi-Jun Chang, Shunhua Jiang:
The Energy Complexity of Las Vegas Leader Election. CoRR abs/2205.08642 (2022) - 2021
- [c5]Yaonan Jin, Shunhua Jiang, Pinyan Lu, Hengjie Zhang:
Tight Revenue Gaps among Multi-Unit Mechanisms. EC 2021: 654-673 - [c4]Yi-Jun Chang, Ran Duan, Shunhua Jiang:
Near-Optimal Time-Energy Trade-Offs for Deterministic Leader Election. SPAA 2021: 162-172 - [c3]Shunhua Jiang, Zhao Song, Omri Weinstein, Hengjie Zhang:
A faster algorithm for solving general LPs. STOC 2021: 823-832 - [i7]Baihe Huang, Shunhua Jiang, Zhao Song, Runzhou Tao:
Solving Tall Dense SDPs in the Current Matrix Multiplication Time. CoRR abs/2101.08208 (2021) - [i6]Yaonan Jin, Shunhua Jiang, Pinyan Lu, Hengjie Zhang:
Tight Revenue Gaps among Multi-Unit Mechanisms. CoRR abs/2102.07454 (2021) - [i5]Yi-Jun Chang, Ran Duan, Shunhua Jiang:
Near-Optimal Time-Energy Trade-Offs for Deterministic Leader Election. CoRR abs/2105.07518 (2021) - [i4]Shunhua Jiang, Yunze Man, Zhao Song, Zheng Yu, Danyang Zhuo:
Fast Graph Neural Tangent Kernel via Kronecker Sketching. CoRR abs/2112.02446 (2021) - 2020
- [i3]Shunhua Jiang, Zhao Song, Omri Weinstein, Hengjie Zhang:
Faster Dynamic Matrix Inverse for Faster LPs. CoRR abs/2004.07470 (2020)
2010 – 2019
- 2019
- [c2]Shunhua Jiang, Kasper Green Larsen:
A Faster External Memory Priority Queue with DecreaseKeys. SODA 2019: 1331-1343 - 2018
- [i2]Shunhua Jiang, Kasper Green Larsen:
A Faster External Memory Priority Queue with DecreaseKeys. CoRR abs/1806.07598 (2018) - 2017
- [c1]Kaifeng Lv, Shunhua Jiang, Jian Li:
Learning Gradient Descent: Better Generalization and Longer Horizons. ICML 2017: 2247-2255 - [i1]Kaifeng Lv, Shunhua Jiang, Jian Li:
Learning Gradient Descent: Better Generalization and Longer Horizons. CoRR abs/1703.03633 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-21 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
