Seguir
David Steurer
David Steurer
Dirección de correo verificada de inf.ethz.ch - Página principal
Título
Citado por
Citado por
Año
Analytical approach to parallel repetition
I Dinur, D Steurer
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
5832014
Graph expansion and the unique games conjecture
P Raghavendra, D Steurer
Proceedings of the 42nd ACM symposium on Theory of computing, 755-764, 2010
2952010
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
284*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
2562012
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
2032015
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
1922015
Rounding semidefinite programming hierarchies via global correlation
B Barak, P Raghavendra, D Steurer
Arxiv preprint arXiv:1104.4680, 2011
1802011
Tensor principal component analysis via sum-of-square proofs
SB Hopkins, J Shi, D Steurer
Conference on Learning Theory, 956-1006, 2015
1722015
Sum-of-squares proofs and the quest toward optimal algorithms
B Barak, D Steurer
arXiv preprint arXiv:1404.5236, 2014
1682014
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
1532016
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
1482016
The power of sum-of-squares for detecting hidden structures
SB Hopkins, PK Kothari, A Potechin, P Raghavendra, T Schramm, ...
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
1462017
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
1462008
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
1452018
Efficient bayesian estimation from few samples: community detection and related problems
SB Hopkins, D Steurer
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
140*2017
Reductions between expansion problems
P Raghavendra, D Steurer, M Tulsiani
2012 IEEE 27th Conference on Computational Complexity, 64-73, 2012
1362012
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
1262016
Approximation limits of linear programs (beyond hierarchies)
G Braun, S Fiorini, S Pokutta, D Steurer
Mathematics of Operations Research 40 (3), 756-772, 2015
1132015
Rounding sum-of-squares relaxations
B Barak, JA Kelner, D Steurer
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
1092014
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
1062009
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20