David Steurer
David Steurer
Verified email at inf.ethz.ch - Homepage
TitleCited byYear
Analytical approach to parallel repetition
I Dinur, D Steurer
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
2522014
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
201*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
1702010
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
1452012
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
1162015
Rounding semidefinite programming hierarchies via global correlation
B Barak, P Raghavendra, D Steurer
Arxiv preprint arXiv:1104.4680, 2011
1062011
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
1032008
Approximate constraint satisfaction requires large LP relaxations
SO Chan, JR Lee, P Raghavendra, D Steurer
Journal of the ACM (JACM) 63 (4), 34, 2016
952016
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
952015
Reductions between expansion problems
P Raghavendra, D Steurer, M Tulsiani
2012 IEEE 27th Conference on Computational Complexity, 64-73, 2012
952012
Sum-of-squares proofs and the quest toward optimal algorithms
B Barak, D Steurer
arXiv preprint arXiv:1404.5236, 2014
932014
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
892009
Approximation limits of linear programs (beyond hierarchies)
G Braun, S Fiorini, S Pokutta, D Steurer
Mathematics of Operations Research 40 (3), 756-772, 2015
882015
Tensor principal component analysis via sum-of-square proofs
SB Hopkins, J Shi, D Steurer
Conference on Learning Theory, 956-1006, 2015
692015
Rounding sum-of-squares relaxations
B Barak, JA Kelner, D Steurer
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
682014
Message-passing algorithms and improved LP decoding
S Arora, C Daskalakis, D Steurer
IEEE Transactions on Information Theory 58 (12), 7260-7271, 2012
652012
How to round any CSP
P Raghavendra, D Steurer
Foundations of Computer Science, 2009. FOCS'09. 50th Annual IEEE Symposium …, 2009
652009
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
592015
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
51*2016
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
462016
The system can't perform the operation now. Try again later.
Articles 1–20