| Analytical approach to parallel repetition I Dinur, D Steurer Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014 | 286 | 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 | 209* | 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 | 180 | 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 | 154 | 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 | 128 | 2015 |
| Rounding semidefinite programming hierarchies via global correlation B Barak, P Raghavendra, D Steurer Arxiv preprint arXiv:1104.4680, 2011 | 114 | 2011 |
| 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 | 109 | 2015 |
| 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 | 107 | 2008 |
| Sum-of-squares proofs and the quest toward optimal algorithms B Barak, D Steurer arXiv preprint arXiv:1404.5236, 2014 | 102 | 2014 |
| Reductions between expansion problems P Raghavendra, D Steurer, M Tulsiani 2012 IEEE 27th Conference on Computational Complexity, 64-73, 2012 | 100 | 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 | 99 | 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 | 94 | 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 | 94 | 2009 |
| Tensor principal component analysis via sum-of-square proofs SB Hopkins, J Shi, D Steurer Conference on Learning Theory, 956-1006, 2015 | 75 | 2015 |
| Rounding sum-of-squares relaxations B Barak, JA Kelner, D Steurer Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014 | 70 | 2014 |
| Message-passing algorithms and improved LP decoding S Arora, C Daskalakis, D Steurer IEEE transactions on information theory 58 (12), 7260-7271, 2012 | 65 | 2012 |
| How to round any CSP P Raghavendra, D Steurer Foundations of Computer Science, 2009. FOCS'09. 50th Annual IEEE Symposium …, 2009 | 64 | 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 | 62* | 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 | 62 | 2015 |
| 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 | 57 | 2016 |
Sanjeev AroraProfessor of Computer Science, Princeton UniversityVerified email at cs.princeton.edu
