David Steurer

Cited by

	All	Since 2016
Citations	3712	2471
h-index	32	26
i10-index	48	39

540

270

135

405

200920102011201220132014201520162017201820192020202145 91 114 189 158 241 300 340 376 478 430 523 321

Public access

View all

10 articles

1 article

available

not available

Based on funding mandates

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
Peter SandersProfessor of Computer Science, Karlsruhe Institute of TechnologyVerified email at kit.edu
Fernando G.S.L. BrandãoAWS and 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
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 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	403	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	235*	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	233	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	188	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	162	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	144	2015
Rounding semidefinite programming hierarchies via global correlation B Barak, P Raghavendra, D Steurer Arxiv preprint arXiv:1104.4680, 2011	131	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	124	2008
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	122	2016
Sum-of-squares proofs and the quest toward optimal algorithms B Barak, D Steurer arXiv preprint arXiv:1404.5236, 2014	121	2014
Tensor principal component analysis via sum-of-square proofs SB Hopkins, J Shi, D Steurer Conference on Learning Theory, 956-1006, 2015	120	2015
Reductions between expansion problems P Raghavendra, D Steurer, M Tulsiani 2012 IEEE 27th Conference on Computational Complexity, 64-73, 2012	114	2012
Approximation limits of linear programs (beyond hierarchies) G Braun, S Fiorini, S Pokutta, D Steurer Mathematics of Operations Research 40 (3), 756-772, 2015	104	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	101	2009
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	98	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	87	2014
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	79	2016
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	73	2015
Robust moment estimation and improved clustering via sum of squares PK Kothari, J Steinhardt, D Steurer Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018	72	2018
How to round any CSP P Raghavendra, D Steurer Foundations of Computer Science, 2009. FOCS'09. 50th Annual IEEE Symposium …, 2009	72	2009

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

Follow this author

Cited by

Co-authors