| A nearly tight sum-of-squares lower bound for the planted clique problem B Barak, S Hopkins, J Kelner, PK Kothari, A Moitra, A Potechin SIAM Journal on Computing 48 (2), 687-735, 2019 | 72 | 2019 |
| Tensor principal component analysis via sum-of-squares proofs SB Hopkins, J Shi, D Steurer arXiv preprint arXiv:1507.03269, 2015 | 69 | 2015 |
| Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors SB Hopkins, T Schramm, J Shi, D Steurer arXiv preprint arXiv:1512.02337, 2016 | 51* | 2016 |
| On the integrality gap of degree-4 sum of squares for planted clique SB Hopkins, P Kothari, AH Potechin, P Raghavendra, T Schramm ACM Transactions on Algorithms (TALG) 14 (3), 28, 2018 | 32* | 2018 |
| 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 | 24 | 2017 |
| Mixture models, robustness, and sum of squares proofs SB Hopkins, J Li Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018 | 22 | 2018 |
| Bayesian estimation from few samples: community detection and related problems SB Hopkins, D Steurer arXiv preprint arXiv:1710.00264, 2017 | 19* | 2017 |
| Kolmogorov Complexity, Circuits, and the Strength of Formal Theories of Arithmetic. E Allender, G Davie, L Friedman, S Hopkins, I Tzameret Chicago Journal of Theoretical Computer Science 2013, 15, 2013 | 10 | 2013 |
| Sub-Gaussian mean estimation in polynomial time SB Hopkins arXiv preprint arXiv:1809.07425, 2018 | 8 | 2018 |
| Statistical Inference and the Sum of Squares Method SBK Hopkins | 5 | 2018 |
| Sum-of-squares meets program obfuscation, revisited B Barak, SB Hopkins, A Jain, P Kothari, A Sahai Annual International Conference on the Theory and Applications of …, 2019 | 4 | 2019 |
| Quantum Entropy Scoring for Fast Robust Mean Estimation and Improved Outlier Detection Y Dong, SB Hopkins, J Li arXiv preprint arXiv:1906.11366, 2019 | 1 | 2019 |
| How Hard Is Robust Mean Estimation? SB Hopkins, J Li arXiv preprint arXiv:1903.07870, 2019 | 1 | 2019 |
| A Robust Spectral Algorithm for Overcomplete Tensor Decomposition SB Hopkins, T Schramm, J Shi Conference on Learning Theory, 1683-1722, 2019 | | 2019 |
David SteurerETH ZürichVerified email at inf.ethz.ch