| Fast algorithm for overcomplete order-3 tensor decomposition. | 0 | 0.34 | 2022 |
| Robust recovery for stochastic block models | 2 | 0.37 | 2021 |
| Playing unique games on certified small-set expanders | 0 | 0.34 | 2021 |
| Consistent Estimation for PCA and Sparse Regression with Oblivious Outliers. | 0 | 0.34 | 2021 |
| SoS degree reduction with applications to clustering and robust moment estimation | 0 | 0.34 | 2021 |
| Consistent Regression When Oblivious Outliers Overwhelm | 0 | 0.34 | 2021 |
| Estimating Rank-One Spikes from Heavy-Tailed Noise via Self-Avoiding Walks | 0 | 0.34 | 2020 |
| Sparse PCA: Algorithms, Adversarial Perturbations and Certificates | 1 | 0.38 | 2020 |
| Robust moment estimation and improved clustering via sum of squares. | 4 | 0.42 | 2018 |
| Small-Set Expansion in Shortcode Graph and the 2-to-2 Conjecture. | 2 | 0.38 | 2018 |
| Efficient Bayesian Estimation from Few Samples: Community Detection and Related Problems | 3 | 0.39 | 2017 |
| Outlier-robust moment-estimation via sum-of-squares. | 3 | 0.40 | 2017 |
| Quantum entanglement, sum of squares, and the log rank conjecture. | 2 | 0.38 | 2017 |
| Exact tensor completion with sum-of-squares. | 5 | 0.44 | 2017 |
| Bayesian estimation from few samples: community detection and related problems. | 4 | 0.39 | 2017 |
| Fast and robust tensor decomposition with applications to dictionary learning. | 4 | 0.38 | 2017 |
| The Power of Sum-of-Squares for Detecting Hidden Structures | 6 | 0.41 | 2017 |
| Polynomial-Time Tensor Decompositions with Sum-of-Squares | 19 | 0.70 | 2016 |
| Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors. | 18 | 0.67 | 2016 |
| Beating the random assignment on constraint satisfaction problems of bounded degree. | 6 | 0.64 | 2015 |
| Tensor principal component analysis via sum-of-square proofs. | 21 | 0.76 | 2015 |
| Speeding up sum-of-squares for tensor decomposition and planted sparse vectors | 2 | 0.40 | 2015 |
| A parallel repetition theorem for entangled projection games. | 16 | 0.89 | 2015 |
| The 2013 Newton Institute Programme on polynomial optimization | 0 | 0.34 | 2015 |
| Sum-Of-Squares Proofs And The Quest Toward Optimal Algorithms | 32 | 1.07 | 2014 |
| Lower bounds on the size of semidefinite programming relaxations. | 57 | 1.86 | 2014 |
| On the Power of Symmetric LP and SDP Relaxations | 8 | 0.53 | 2014 |
| Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method. | 43 | 1.23 | 2014 |
| On the optimality of semidefinite relaxations for average-case and generalized constraint satisfaction | 14 | 0.60 | 2013 |
| Analytical approach to parallel repetition | 107 | 3.59 | 2013 |
| Rounding sum-of-squares relaxations | 31 | 1.00 | 2013 |
| Direct Product Testing | 9 | 0.59 | 2013 |
| Approximate Constraint Satisfaction Requires Large LP Relaxations | 14 | 0.72 | 2013 |
| Hypercontractivity, sum-of-squares proofs, and their applications | 22 | 0.79 | 2012 |
| Making the Long Code Shorter | 20 | 0.72 | 2012 |
| Message-Passing Algorithms and Improved LP Decoding | 29 | 1.13 | 2012 |
| Approximation Limits of Linear Programs (Beyond Hierarchies) | 21 | 1.08 | 2012 |
| Rounding Semidefinite Programming Hierarchies via Global Correlation | 14 | 0.66 | 2011 |
| Making the long code shorter, with applications to the Unique Games Conjecture | 14 | 0.75 | 2011 |
| Finding Almost-Perfect Graph Bisections. | 7 | 0.47 | 2011 |
| Reductions between Expansion Problems | 45 | 1.43 | 2010 |
| Subexponential Algorithms for Unique Games and Related Problems | 31 | 1.17 | 2010 |
| Graph expansion and the unique games conjecture | 92 | 2.99 | 2010 |
| Approximations for the isoperimetric and spectral profile of graphs and related parameters | 26 | 1.11 | 2010 |
| Improved Algorithms for Unique Games via Divide and Conquer | 5 | 0.58 | 2010 |
| Fast SDP Algorithms for Constraint Satisfaction Problems | 7 | 0.55 | 2010 |
| Improved rounding for parallel repeated unique games | 1 | 0.46 | 2010 |
| Integrality Gaps for Strong SDP Relaxations of UNIQUE GAMES | 47 | 1.65 | 2009 |
| How to Round Any CSP | 28 | 1.09 | 2009 |
| Towards computing the Grothendieck constant | 9 | 0.62 | 2009 |
