David Steurer - Google Scholar

Cited by

	All	Since 2015
Citations	3235	2347
h-index	30	24
i10-index	48	41

520

260

130

390

20092010201120122013201420152016201720182019202037 92 114 184 158 241 296 324 366 503 472 380

Co-authors

Sanjeev AroraProfessor of Computer Science, Princeton UniversityVerified email at cs.princeton.edu
Samuel B. HopkinsMiller Fellow, UC BerkeleyVerified email at berkeley.edu
Moritz HardtUniversity of California, BerkeleyVerified email at berkeley.edu
Madhur TulsianiTTI-ChicagoVerified email at ttic.edu
Yuan ZhouDepartment of ISE, University of Illinois Urbana-ChampaignVerified email at illinois.edu
Aaron PotechinUniversity of ChicagoVerified email at uchicago.edu
Oded RegevProfessor of Computer ScienceVerified email at cims.nyu.edu
Fernando G.S.L. BrandãoHead of Quantum Algorithms at AWS and Bren Professor of Theoretical Physics at CaltechVerified email at caltech.edu
aram harrowPhysics, MITVerified email at mit.edu
Raghu MekaUniversity of California, Los AngelesVerified email at cs.ucla.edu
Parikshit GopalanVMwareVerified email at vmware.com
Johan HåstadProfessor i teoretisk datalogi, KTHVerified email at kth.se
James R. LeeProfessor of Computer Science, University of WashingtonVerified email at cs.washington.edu
Alexandra KollaAssistant Professor of Computer Science, University of Illinois Urbana ChampaignVerified email at illinois.edu
Peter SandersProfessor of Computer Science, Karlsruhe Institute of TechnologyVerified email at kit.edu
Samuel FioriniUniversité libre de BruxellesVerified email at ulb.ac.be
Guy KindlerThe Hebrew UniversityVerified email at cs.huji.ac.il
Constantinos DaskalakisProfessor of Computer Science, MITVerified email at csail.mit.edu
Anup RaoProfessor of Computer Science, University of WashingtonVerified email at cs.washington.edu
Thomas VidickProfessor, CMS, CaltechVerified email at cms.caltech.edu

David Steurer

ETH Zürich

Verified email at inf.ethz.ch - Homepage

Algorithms Complexity


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Analytical approach to parallel repetition I Dinur, D Steurer Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014	330	2014
Subexponential algorithms for unique games and related problems S Arora, B Barak, D Steurer Foundations of Computer Science (FOCS), 2010 51st Annual IEEE Symposium on …, 2010	220*	2010
Graph expansion and the unique games conjecture P Raghavendra, D Steurer Proceedings of the 42nd ACM symposium on Theory of computing, 755-764, 2010	208	2010
Hypercontractivity, sum-of-squares proofs, and their applications B Barak, FGSL Brandao, AW Harrow, J Kelner, D Steurer, Y Zhou Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012	164	2012
Lower bounds on the size of semidefinite programming relaxations JR Lee, P Raghavendra, D Steurer Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015	145	2015
Dictionary learning and tensor decomposition via the sum-of-squares method B Barak, JA Kelner, D Steurer Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015	125	2015
Rounding semidefinite programming hierarchies via global correlation B Barak, P Raghavendra, D Steurer Arxiv preprint arXiv:1104.4680, 2011	119	2011
Unique games on expanding constraint graphs are easy S Arora, SA Khot, A Kolla, D Steurer, M Tulsiani, NK Vishnoi Proceedings of the 40th annual ACM symposium on Theory of computing, 21-28, 2008	113	2008
Sum-of-squares proofs and the quest toward optimal algorithms B Barak, D Steurer arXiv preprint arXiv:1404.5236, 2014	110	2014
Reductions between expansion problems P Raghavendra, D Steurer, M Tulsiani 2012 IEEE 27th Conference on Computational Complexity, 64-73, 2012	107	2012
Approximate constraint satisfaction requires large LP relaxations SO Chan, JR Lee, P Raghavendra, D Steurer Journal of the ACM (JACM) 63 (4), 1-22, 2016	106	2016
Approximation limits of linear programs (beyond hierarchies) G Braun, S Fiorini, S Pokutta, D Steurer Mathematics of Operations Research 40 (3), 756-772, 2015	99	2015
Integrality gaps for strong SDP relaxations of unique games P Raghavendra, D Steurer Foundations of Computer Science, 2009. FOCS'09. 50th Annual IEEE Symposium …, 2009	97	2009
Tensor principal component analysis via sum-of-square proofs SB Hopkins, J Shi, D Steurer Conference on Learning Theory, 956-1006, 2015	96	2015
Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors SB Hopkins, T Schramm, J Shi, D Steurer Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016	78*	2016
Rounding sum-of-squares relaxations B Barak, JA Kelner, D Steurer Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014	73	2014
Message-passing algorithms and improved LP decoding S Arora, C Daskalakis, D Steurer IEEE transactions on information theory 58 (12), 7260-7271, 2012	68	2012
Making the long code shorter B Barak, P Gopalan, J Håstad, R Meka, P Raghavendra, D Steurer SIAM Journal on Computing 44 (5), 1287-1324, 2015	67	2015
How to round any CSP P Raghavendra, D Steurer Foundations of Computer Science, 2009. FOCS'09. 50th Annual IEEE Symposium …, 2009	66	2009
Polynomial-time tensor decompositions with sum-of-squares T Ma, J Shi, D Steurer 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016	65	2016

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Upload PDF

Follow this author

Cited by

Co-authors