| 2026 | COLT | Dimension Reduction via Sum-of-Squares and Improved Clustering Algorithms for Non-Spherical Mixtures. | Prashanti Anderson, Mitali Bafna, Rares-Darius Buhai, Pravesh K. Kothari, David Steurer |
| 2026 | COLT | Rate-optimal community detection near the KS threshold via node-robust algorithms. | Jingqiu Ding, Yiding Hua, Kasper Lindberg, David Steurer, Aleksandr Storozhenko |
| 2026 | COLT | Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity. | Haitong Liu, Deepak Narayanan Sridharan, David Steurer, Manuel Wiedmer |
| 2026 | STOC | Hesse's Redemption: Efficient Convex Polynomial Programming. | Lucas Slot, David Steurer, Manuel Wiedmer |
| 2025 | FOCS | Finding Colorings in One-Sided Expanders. | Rares-Darius Buhai, Yiding Hua, David Steurer, Andor Vri-Kakas |
| 2025 | SODA | Outlier-robust Mean Estimation near the Breakdown Point via Sum-of-Squares. | Hongjie Chen, Deepak Narayanan Sridharan, David Steurer |
| 2024 | FOCS | Semirandom Planted Clique and the Restricted Isometry Property. | Jaroslaw Blasiok, Rares-Darius Buhai, Pravesh K. Kothari, David Steurer |
| 2024 | STOC | Private Graphon Estimation via Sum-of-Squares. | Hongjie Chen, Jingqiu Ding, Tommaso d'Orsi, Yiding Hua, Chih-Hung Liu, David Steurer |
| 2023 | COLT | Beyond Parallel Pancakes: Quasi-Polynomial Time Guarantees for Non-Spherical Gaussian Mixtures. | Rares-Darius Buhai, David Steurer |
| 2023 | COLT | Reaching Kesten-Stigum Threshold in the Stochastic Block Model under Node Corruptions. | Yiding Hua, Jingqiu Ding, Tommaso d'Orsi, David Steurer |
| 2023 | SODA | Higher degree sum-of-squares relaxations robust against oblivious outliers. | Tommaso d'Orsi, Rajai Nasser, Gleb Novikov, David Steurer |
| 2023 | STOC | Algorithms Approaching the Threshold for Semi-random Planted Clique. | Rares-Darius Buhai, Pravesh K. Kothari, David Steurer |
| 2022 | COLT | Fast algorithm for overcomplete order-3 tensor decomposition. | Jingqiu Ding, Tommaso d'Orsi, Chih-Hung Liu, David Steurer, Stefan Tiegel |
| 2021 | FOCS | Robust recovery for stochastic block models. | Jingqiu Ding, Tommaso d'Orsi, Rajai Nasser, David Steurer |
| 2021 | ICML | Consistent regression when oblivious outliers overwhelm. | Tommaso d'Orsi, Gleb Novikov, David Steurer |
| 2021 | SODA | SoS Degree Reduction with Applications to Clustering and Robust Moment Estimation. | David Steurer, Stefan Tiegel |
| 2021 | STOC | Playing unique games on certified small-set expanders. | Mitali Bafna, Boaz Barak, Pravesh K. Kothari, Tselil Schramm, David Steurer |
| 2020 | FOCS | Sparse PCA: Algorithms, Adversarial Perturbations and Certificates. | Tommaso d'Orsi, Pravesh K. Kothari, Gleb Novikov, David Steurer |
| 2018 | STOC | Robust moment estimation and improved clustering via sum of squares. | Pravesh K. Kothari, Jacob Steinhardt, David Steurer |
| 2017 | COLT | Exact tensor completion with sum-of-squares. | Aaron Potechin, David Steurer |
| 2017 | COLT | Fast and robust tensor decomposition with applications to dictionary learning. | Tselil Schramm, David Steurer |
| 2017 | FOCS | The Power of Sum-of-Squares for Detecting Hidden Structures. | Samuel B. Hopkins, Pravesh K. Kothari, Aaron Potechin, Prasad Raghavendra, Tselil Schramm, David Steurer |
| 2017 | FOCS | Efficient Bayesian Estimation from Few Samples: Community Detection and Related Problems. | Samuel B. Hopkins, David Steurer |
| 2017 | STOC | Quantum entanglement, sum of squares, and the log rank conjecture. | Boaz Barak, Pravesh K. Kothari, David Steurer |
| 2016 | FOCS | Polynomial-Time Tensor Decompositions with Sum-of-Squares. | Tengyu Ma, Jonathan Shi, David Steurer |
| 2016 | STOC | Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors. | Samuel B. Hopkins, Tselil Schramm, Jonathan Shi, David Steurer |
| 2015 | COLT | Tensor principal component analysis via sum-of-square proofs. | Samuel B. Hopkins, Jonathan Shi, David Steurer |
| 2015 | STOC | Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method. | Boaz Barak, Jonathan A. Kelner, David Steurer |
| 2015 | STOC | Lower Bounds on the Size of Semidefinite Programming Relaxations. | James R. Lee, Prasad Raghavendra, David Steurer |
| 2014 | STOC | Rounding sum-of-squares relaxations. | Boaz Barak, Jonathan A. Kelner, David Steurer |
| 2014 | STOC | Analytical approach to parallel repetition. | Irit Dinur, David Steurer |
| 2013 | FOCS | Approximate Constraint Satisfaction Requires Large LP Relaxations. | Siu On Chan, James R. Lee, Prasad Raghavendra, David Steurer |
| 2012 | FOCS | Making the Long Code Shorter. | Boaz Barak, Parikshit Gopalan, Johan Hstad, Raghu Meka, Prasad Raghavendra, David Steurer |
| 2012 | FOCS | Approximation Limits of Linear Programs (Beyond Hierarchies). | Gbor Braun, Samuel Fiorini, Sebastian Pokutta, David Steurer |
| 2012 | STOC | Hypercontractivity, sum-of-squares proofs, and their applications. | Boaz Barak, Fernando G. S. L. Brando, Aram W. Harrow, Jonathan A. Kelner, David Steurer, Yuan Zhou |
| 2011 | FOCS | Rounding Semidefinite Programming Hierarchies via Global Correlation. | Boaz Barak, Prasad Raghavendra, David Steurer |
| 2011 | SODA | Subsampling Mathematical Relaxations and Average-case Complexity. | Boaz Barak, Moritz Hardt, Thomas Holenstein, David Steurer |
| 2010 | FOCS | Subexponential Algorithms for Unique Games and Related Problems. | Sanjeev Arora, Boaz Barak, David Steurer |
| 2010 | SODA | Fast SDP Algorithms for Constraint Satisfaction Problems. | David Steurer |
| 2010 | STOC | Graph expansion and the unique games conjecture. | Prasad Raghavendra, David Steurer |
| 2010 | STOC | Approximations for the isoperimetric and spectral profile of graphs and related parameters. | Prasad Raghavendra, David Steurer, Prasad Tetali |
| 2009 | FOCS | Integrality Gaps for Strong SDP Relaxations of UNIQUE GAMES. | Prasad Raghavendra, David Steurer |
| 2009 | FOCS | How to Round Any CSP. | Prasad Raghavendra, David Steurer |
| 2009 | ICALP | Towards a Study of Low-Complexity Graphs. | Sanjeev Arora, David Steurer, Avi Wigderson |
| 2009 | SODA | Towards computing the Grothendieck constant. | Prasad Raghavendra, David Steurer |
| 2009 | STOC | Message passing algorithms and improved LP decoding. | Sanjeev Arora, Constantinos Daskalakis, David Steurer |
| 2008 | FOCS | Rounding Parallel Repetitions of Unique Games. | Boaz Barak, Moritz Hardt, Ishay Haviv, Anup Rao, Oded Regev, David Steurer |
| 2008 | ICALP | Asymptotically Optimal Hitting Sets Against Polynomials. | Markus Blser, Moritz Hardt, David Steurer |
| 2008 | STOC | Unique games on expanding constraint graphs are easy: extended abstract. | Sanjeev Arora, Subhash Khot, Alexandra Kolla, David Steurer, Madhur Tulsiani, Nisheeth K. Vishnoi |
| 2006 | ISAAC | The Interval Liar Game. | Benjamin Doerr, Johannes Lengler, David Steurer |
| 2006 | SPAA | Tight bounds for the Min-Max boundary decomposition cost of weighted graphs. | David Steurer |
| 2005 | SODA | An asymptotic approximation scheme for multigraph edge coloring. | Peter Sanders, David Steurer |