default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJonathan Shi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i10]Juspreet Singh Sandhu, Jonathan Shi:
A Sum-of-Squares Hierarchy in the Absence of Pointwise Proofs I: Energy Certificates. CoRR abs/2401.14383 (2024)- [i9]David Jekel, Juspreet Singh Sandhu, Jonathan Shi:
Potential Hessian Ascent: The Sherrington-Kirkpatrick Model. CoRR abs/2408.02360 (2024) - 2023
- [c9]Chris Jones, Kunal Marwaha
, Juspreet Singh Sandhu, Jonathan Shi:
Random Max-CSPs Inherit Algorithmic Hardness from Spin Glasses. ITCS 2023: 77:1-77:26 - 2022
- [c8]Chi-Ning Chou, Peter J. Love, Juspreet Singh Sandhu, Jonathan Shi:
Limitations of Local Quantum Algorithms on Random MAX-k-XOR and Beyond. ICALP 2022: 41:1-41:20 - [c7]Antares Chen, Jonathan Shi, Luca Trevisan:
Cut Sparsification of the Clique Beyond the Ramanujan Bound: A Separation of Cut Versus Spectral Sparsification. SODA 2022: 3693-3731 - [i8]Samuel B. Hopkins, Tselil Schramm, Jonathan Shi:
A Robust Spectral Algorithm for Overcomplete Tensor Decomposition. CoRR abs/2203.02790 (2022) - [i7]Chris Jones, Kunal Marwaha, Juspreet Singh Sandhu, Jonathan Shi:
Random Max-CSPs Inherit Algorithmic Hardness from Spin Glasses. CoRR abs/2210.03006 (2022) - 2021
- [i6]Chi-Ning Chou, Peter J. Love, Juspreet Singh Sandhu, Jonathan Shi:
Limitations of Local Quantum Algorithms on Maximum Cuts of Sparse Hypergraphs and Beyond. CoRR abs/2108.06049 (2021) - 2020
- [i5]Antares Chen, Jonathan Shi, Luca Trevisan:
Cut Sparsification of the Clique Beyond the Ramanujan Bound. CoRR abs/2008.05648 (2020)
2010 – 2019
- 2019
- [b1]Jonathan Shi:
Tensor rank decompositions via the pseudo-moment method. Cornell University, USA, 2019 - [c6]Samuel B. Hopkins, Tselil Schramm, Jonathan Shi:
A Robust Spectral Algorithm for Overcomplete Tensor Decomposition. COLT 2019: 1683-1722 - 2017
- [j1]Dave Bacon, Steven T. Flammia, Aram W. Harrow, Jonathan Shi:
Sparse Quantum Codes From Quantum Circuits. IEEE Trans. Inf. Theory 63(4): 2464-2479 (2017) - 2016
- [c5]Tengyu Ma, Jonathan Shi, David Steurer:
Polynomial-Time Tensor Decompositions with Sum-of-Squares. FOCS 2016: 438-446 - [c4]Samuel B. Hopkins, Tselil Schramm, Jonathan Shi, David Steurer:
Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors. STOC 2016: 178-191 - [i4]Tengyu Ma, Jonathan Shi, David Steurer:
Polynomial-time Tensor Decompositions with Sum-of-Squares. CoRR abs/1610.01980 (2016) - 2015
- [c3]Samuel B. Hopkins, Jonathan Shi, David Steurer:
Tensor principal component analysis via sum-of-square proofs. COLT 2015: 956-1006 - [c2]Dave Bacon, Steven T. Flammia, Aram W. Harrow, Jonathan Shi:
Sparse Quantum Codes from Quantum Circuits. STOC 2015: 327-334 - [i3]Samuel B. Hopkins, Jonathan Shi, David Steurer:
Tensor principal component analysis via sum-of-squares proofs. CoRR abs/1507.03269 (2015) - [i2]Samuel B. Hopkins, Tselil Schramm, Jonathan Shi, David Steurer:
Speeding up sum-of-squares for tensor decomposition and planted sparse vectors. CoRR abs/1512.02337 (2015) - 2014
- [i1]Dave Bacon, Steven T. Flammia, Aram W. Harrow, Jonathan Shi:
Sparse Quantum Codes from Quantum Circuits. CoRR abs/1411.3334 (2014)
2000 – 2009
- 2009
- [c1]Kun-Jung Hsu, Jonathan Shi:
A tractable time-cost tradeoff algorithm for project activity management. SpringSim 2009
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-09-30 00:58 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:
