David Steurer

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Outlier-robust Mean Estimation near the Breakdown Point via Sum-of-Squares	2025	Hongjie Chen Devarajan Sridharan David Steurer
+ PDF Chat	Outlier-robust Mean Estimation near the Breakdown Point via Sum-of-Squares	2024	Hongjie Chen Devarajan Sridharan David Steurer
+ PDF Chat	Dimension Reduction via Sum-of-Squares and Improved Clustering Algorithms for Non-Spherical Mixtures	2024	Peter Anderson Mitali Bafna Rares-Darius Buhai Pravesh K. Kothari David Steurer
+ PDF Chat	Robust Mixture Learning when Outliers Overwhelm Small Groups	2024	Daniil Dmitriev Rares-Darius Buhai Stefan Tiegel A.A. Wolters Gleb Novikov Amartya Sanyal David Steurer Fanny Yang
+	Private Graphon Estimation via Sum-of-Squares	2024	Hongjie Chen Jingqiu Ding Tommaso d'Orsi Yiding Hua Chih-Hung Liu David Steurer
+ PDF Chat	Private Edge Density Estimation for Random Graphs: Optimal, Efficient and Robust	2024	Hongjie Chen Jingqiu Ding Yiding Hua David Steurer
+ PDF Chat	Semirandom Planted Clique and the Restricted Isometry Property	2024	Jarosław Błasiok Rares-Darius Buhai Pravesh K. Kothari David Steurer
+ PDF Chat	Private graphon estimation via sum-of-squares	2024	Hongjie Chen Jingqiu Ding Tommaso d'Orsi Yiding Hua Chih-Hung Liu David Steurer
+	Algorithms Approaching the Threshold for Semi-random Planted Clique	2023	Rares-Darius Buhai Pravesh K. Kothari David Steurer
+	Private estimation algorithms for stochastic block models and mixture models	2023	Hongjie Chen Vincent Cohen-Addad Tommaso d'Orsi Alessandro Epasto Jacob Imola David Steurer Stefan Tiegel
+ PDF Chat	Higher degree sum-of-squares relaxations robust against oblivious outliers	2023	Tommaso d'Orsi Rajai Nasser Gleb Novikov David Steurer
+	Robust Mean Estimation Without Moments for Symmetric Distributions	2023	Gleb Novikov David Steurer Stefan Tiegel
+	Reaching Kesten-Stigum Threshold in the Stochastic Block Model under Node Corruptions	2023	Jingqiu Ding Tommaso d'Orsi Yiding Hua David Steurer
+ PDF Chat	Robust recovery for stochastic block models	2022	Jingqiu Ding Tommaso d'Orsi Rajai Nasser David Steurer
+	Fast algorithm for overcomplete order-3 tensor decomposition	2022	Jingqiu Ding Tommaso d'Orsi Chih-Hung Liu Stefan Tiegel David Steurer
+	Higher degree sum-of-squares relaxations robust against oblivious outliers	2022	Tommaso d'Orsi Rajai Nasser Gleb Novikov David Steurer
+	Algorithms approaching the threshold for semi-random planted clique	2022	Rares-Darius Buhai Pravesh K. Kothari David Steurer
+ PDF Chat	Beyond Parallel Pancakes: Quasi-Polynomial Time Guarantees for Non-Spherical Gaussian Mixtures	2021	Rares-Darius Buhai David Steurer
+	Consistent Estimation for PCA and Sparse Regression with Oblivious Outliers	2021	Tommaso d'Orsi Chih-Hung Liu Rajai Nasser Gleb Novikov David Steurer Stefan Tiegel
+	Consistent Estimation for PCA and Sparse Regression with Oblivious Outliers	2021	Tommaso d'Orsi Chih-Hung Liu Rajai Nasser Gleb Novikov David Steurer Stefan Tiegel
+ PDF Chat	Playing unique games on certified small-set expanders	2021	Mitali Bafna Boaz Barak Pravesh K. Kothari Tselil Schramm David Steurer
+	SoS Degree Reduction with Applications to Clustering and Robust Moment Estimation	2021	David Steurer Stefan Tiegel
+ PDF Chat	SoS Degree Reduction with Applications to Clustering and Robust Moment Estimation	2021	David Steurer Stefan Tiegel
+	Robust recovery for stochastic block models	2021	Jingqiu Ding Tommaso d'Orsi Rajai Nasser David Steurer
+	Beyond Parallel Pancakes: Quasi-Polynomial Time Guarantees for Non-Spherical Gaussian Mixtures	2021	Rares-Darius Buhai David Steurer
+	Consistent Estimation for PCA and Sparse Regression with Oblivious Outliers	2021	Tommaso d'Orsi Chih-Hung Liu Rajai Nasser Gleb Novikov David Steurer Stefan Tiegel
+	SoS Degree Reduction with Applications to Clustering and Robust Moment Estimation	2021	David Steurer Stefan Tiegel
+	Sparse PCA: Algorithms, Adversarial Perturbations and Certificates.	2020	Tommaso d'Orsi Pravesh K. Kothari Gleb Novikov David Steurer
+ PDF Chat	Sparse PCA: Algorithms, Adversarial Perturbations and Certificates	2020	Tommaso d'Orsi Pravesh K. Kothari Gleb Novikov David Steurer
+	Regress Consistently when Oblivious Outliers Overwhelm.	2020	Tommaso d'Orsi Gleb Novikov David Steurer
+	Estimating Rank-One Spikes from Heavy-Tailed Noise via Self-Avoiding Walks	2020	Jingqiu Ding Samuel B. Hopkins David Steurer
+	Estimating Rank-One Spikes from Heavy-Tailed Noise via Self-Avoiding Walks	2020	Jingqiu Ding Samuel B. Hopkins David Steurer
+	Consistent regression when oblivious outliers overwhelm	2020	Tommaso d'Orsi Gleb Novikov David Steurer
+	Sparse PCA: Algorithms, Adversarial Perturbations and Certificates	2020	Tommaso d'Orsi Pravesh K. Kothari Gleb Novikov David Steurer
+	Playing Unique Games on Certified Small-Set Expanders	2020	Mitali Bafna Boaz Barak Pravesh K. Kothari Tselil Schramm David Steurer
+ PDF Chat	HIGH DIMENSIONAL ESTIMATION VIA SUM-OF-SQUARES PROOFS	2019	Prasad Raghavendra Tselil Schramm David Steurer
+	Small-Set Expansion in Shortcode Graph and the 2-to-2 Conjecture	2018	Boaz Barak Pravesh K. Kothari David Steurer
+	Small-Set Expansion in Shortcode Graph and the 2-to-2 Conjecture.	2018	Boaz Barak Pravesh K. Kothari David Steurer
+	Small-Set Expansion in Shortcode Graph and the 2-to-2 Conjecture.	2018	Boaz Barak Pravesh K. Kothari David Steurer
+	High-dimensional estimation via sum-of-squares proofs	2018	Prasad Raghavendra Tselil Schramm David Steurer
+	The power of sum-of-squares for detecting hidden structures	2017	Samuel B. Hopkins Pravesh K. Kothari Aaron Potechin Prasad Raghavendra Tselil Schramm David Steurer
+	Efficient Bayesian Estimation from Few Samples: Community Detection and Related Problems	2017	Samuel B. Hopkins David Steurer
+ PDF Chat	The Power of Sum-of-Squares for Detecting Hidden Structures	2017	Samuel B. Hopkins Pravesh K. Kothari Aaron Potechin Prasad Raghavendra Tselil Schramm David Steurer
+	Bayesian estimation from few samples: community detection and related problems	2017	Samuel B. Hopkins David Steurer
+	Fast and robust tensor decomposition with applications to dictionary learning.	2017	Tselil Schramm David Steurer
+	Exact tensor completion with sum-of-squares	2017	Aaron Potechin David Steurer
+	Quantum entanglement, sum of squares, and the log rank conjecture	2017	Boaz Barak Pravesh K. Kothari David Steurer
+	Exact tensor completion with sum-of-squares	2017	Aaron Potechin David Steurer
+	Fast and robust tensor decomposition with applications to dictionary learning	2017	Tselil Schramm David Steurer
+	Outlier-robust moment-estimation via sum-of-squares	2017	Pravesh K. Kothari David Steurer
+	Bayesian estimation from few samples: community detection and related problems	2017	Samuel B. Hopkins David Steurer
+	Exact tensor completion with sum-of-squares	2017	Aaron Potechin David Steurer
+	The power of sum-of-squares for detecting hidden structures	2017	Samuel B. Hopkins Pravesh K. Kothari Aaron Potechin Prasad Raghavendra Tselil Schramm David Steurer
+	Quantum entanglement, sum of squares, and the log rank conjecture	2017	Boaz Barak Pravesh K. Kothari David Steurer
+ PDF Chat	Approximate Constraint Satisfaction Requires Large LP Relaxations	2016	Siu On Chan James R. Lee Prasad Raghavendra David Steurer
+ PDF Chat	Polynomial-Time Tensor Decompositions with Sum-of-Squares	2016	Tengyu Ma Jonathan Shi David Steurer
+ PDF Chat	Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors	2016	Samuel B. Hopkins Tselil Schramm Jonathan Shi David Steurer
+	Polynomial-time Tensor Decompositions with Sum-of-Squares	2016	Tengyu Ma Jonathan Shi David Steurer
+	Speeding up sum-of-squares for tensor decomposition and planted sparse vectors	2015	Samuel B. Hopkins Tselil Schramm Jonathan Shi David Steurer
+	Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors	2015	Samuel B. Hopkins Tselil Schramm Jonathan Shi David Steurer
+	Tensor principal component analysis via sum-of-squares proofs	2015	Samuel B. Hopkins Jonathan Shi David Steurer
+	Tensor principal component analysis via sum-of-square proofs.	2015	Samuel B. Hopkins Jonathan Shi David Steurer
+ PDF Chat	Lower Bounds on the Size of Semidefinite Programming Relaxations	2015	James R. Lee Prasad Raghavendra David Steurer
+ PDF Chat	Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method	2015	Boaz Barak Jonathan A. Kelner David Steurer
+ PDF Chat	A parallel repetition theorem for entangled projection games	2015	Irit Dinur David Steurer Thomas Vidick
+	Beating the random assignment on constraint satisfaction problems of bounded degree	2015	Boaz Barak Ankur Moitra Ryan O’Donnell Prasad Raghavendra Oded Regev David Steurer Luca Trevisan Aravindan Vijayaraghavan David Witmer John C. Wright
+ PDF Chat	The 2013 Newton Institute Programme on polynomial optimization	2015	Adam N. Letchford Jean B. Lasserre Pablo A. Parrilo David Steurer
+ PDF Chat	Approximation Limits of Linear Programs (Beyond Hierarchies)	2015	Gábor Braun Samuel Fiorini Sebastian Pokutta David Steurer
+	Beating the random assignment on constraint satisfaction problems of bounded degree	2015	Boaz Barak Ankur Moitra Ryan O’Donnell Prasad Raghavendra Oded Regev David Steurer Luca Trevisan Aravindan Vijayaraghavan David Witmer John C. Wright
+	Tensor principal component analysis via sum-of-squares proofs	2015	Samuel B. Hopkins Jonathan Shi David Steurer
+	Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors	2015	Samuel B. Hopkins Tselil Schramm Jonathan Shi David Steurer
+	Lower bounds on the size of semidefinite programming relaxations	2014	James R. Lee Prasad Raghavendra David Steurer
+	Sum-of-squares method, tensor decomposition, and dictionary learning	2014	David Steurer
+	On the Power of Symmetric LP and SDP Relaxations	2014	James R. Lee Prasad Raghavendra David Steurer Ning Tan
+ PDF Chat	A Parallel Repetition Theorem for Entangled Projection Games	2014	Irit Dinur David Steurer Thomas Vidick
+ PDF Chat	Analytical approach to parallel repetition	2014	Irit Dinur David Steurer
+ PDF Chat	Rounding sum-of-squares relaxations	2014	Boaz Barak Jonathan A. Kelner David Steurer
+	Sum-of-squares proofs and the quest toward optimal algorithms.	2014	Boaz Barak David Steurer
+	Sum-of-squares proofs and the quest toward optimal algorithms	2014	Boaz Barak David Steurer
+	Lower bounds on the size of semidefinite programming relaxations	2014	James R. Lee Prasad Raghavendra David Steurer
+	Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method	2014	Boaz Barak Jonathan A. Kelner David Steurer
+	Rounding Sum-of-Squares Relaxations	2013	Boaz Barak Jonathan A. Kelner David Steurer
+	A parallel repetition theorem for entangled projection games	2013	Irit Dinur David Steurer Thomas Vidick
+ PDF Chat	Approximate Constraint Satisfaction Requires Large LP Relaxations	2013	Siu On Chan James R. Lee Prasad Raghavendra David Steurer
+	Approximate Constraint Satisfaction Requires Large LP Relaxations	2013	Siu On Chan James R. Lee Prasad Raghavendra David Steurer
+	Analytical Approach to Parallel Repetition	2013	Irit Dinur David Steurer
+	Rounding Sum-of-Squares Relaxations.	2013	Boaz Barak Jonathan A. Kelner David Steurer
+	Rounding Sum-of-Squares Relaxations	2013	Boaz Barak Jonathan A. Kelner David Steurer
+	Analytical Approach to Parallel Repetition	2013	Irit Dinur David Steurer
+	Approximate Constraint Satisfaction Requires Large LP Relaxations	2013	Siu On Chan James R. Lee Prasad Raghavendra David Steurer
+	A parallel repetition theorem for entangled projection games	2013	Irit Dinur David Steurer Thomas Vidick
+ PDF Chat	Approximation Limits of Linear Programs (Beyond Hierarchies)	2012	Gábor Braun Samuel Fiorini Sebastian Pokutta David Steurer
+	Making the Long Code Shorter	2012	Boaz Barak Parikshit Gopalan Johan Håstad Raghu Meka Prasad Raghavendra David Steurer
+ PDF Chat	Reductions between Expansion Problems	2012	Prasad Raghavendra David Steurer Madhur Tulsiani
+ PDF Chat	Hypercontractivity, sum-of-squares proofs, and their applications	2012	Boaz Barak Fernando G. S. L. Brandão Aram W. Harrow Jonathan A. Kelner David Steurer Yuan Zhou
+	Approximation Limits of Linear Programs (Beyond Hierarchies)	2012	Gábor Braun Samuel Fiorini Sebastian Pokutta David Steurer
+	Approximation Limits of Linear Programs (Beyond Hierarchies)	2012	Gábor Braun Samuel Fiorini Sebastian Pokutta David Steurer
+	Making the long code shorter, with applications to the Unique Games Conjecture	2011	Boaz Barak Parikshit Gopalan Johan Håstad Raghu Meka Prasad Raghavendra David Steurer
+ PDF Chat	Rounding Semidefinite Programming Hierarchies via Global Correlation	2011	Boaz Barak Prasad Raghavendra David Steurer
+	Rounding Semidefinite Programming Hierarchies via Global Correlation	2011	Boaz Barak Prasad Raghavendra David Steurer
+ PDF Chat	Subsampling Mathematical Relaxations and Average-case Complexity	2011	Boaz Barak Moritz Hardt Thomas Holenstein David Steurer
+	Making the long code shorter, with applications to the Unique Games Conjecture	2011	Boaz Barak Parikshit Gopalan Johan Håstad Raghu Meka Prasad Raghavendra David Steurer
+	Rounding Semidefinite Programming Hierarchies via Global Correlation	2011	Boaz Barak Prasad Raghavendra David Steurer
+	Reductions Between Expansion Problems	2010	Prasad Raghavendra David Steurer Madhur Tulsiani
+	Approximations for the isoperimetric and spectral profile of graphs and related parameters	2010	Prasad Raghavendra David Steurer Prasad Tetali
+	Reductions Between Expansion Problems.	2010	Prasad Raghavendra David Steurer Madhur Tulsiani
+	Reductions Between Expansion Problems	2010	Prasad Raghavendra David Steurer Madhur Tulsiani
+	Towards computing the Grothendieck constant	2009	Prasad Raghavendra David Steurer
+	Towards Computing the Grothendieck Constant	2009	Prasad Raghavendra David Steurer
+	Subsampling Semidefinite Programs and Max-Cut on the Sphere	2009	Boaz Barak Moritz Hardt Thomas Holenstein David Steurer
+	Subsampling Mathematical Relaxations and Average-case Complexity	2009	Boaz Barak Moritz Hardt Thomas Holenstein David Steurer
+ PDF Chat	Tight bounds for the Min-Max boundary decomposition cost of weighted graphs	2006	David Steurer
+	Tight Bounds for the Min-Max Boundary Decomposition Cost of Weighted Graphs	2006	David Steurer

Common Coauthors

Coauthor	Papers Together
Prasad Raghavendra	28
Boaz Barak	27
Pravesh K. Kothari	18
Tommaso d'Orsi	17
Samuel B. Hopkins	15
Tselil Schramm	13
Gleb Novikov	12
Stefan Tiegel	10
Jonathan Shi	9
Jingqiu Ding	9
James R. Lee	8
Rajai Nasser	7
Irit Dinur	7
Jonathan A. Kelner	7
Rares-Darius Buhai	7
Aaron Potechin	6
Chih-Hung Liu	6
Samuel Fiorini	4
Thomas Vidick	4
Sebastian Pokutta	4
Gábor Braun	4
Madhur Tulsiani	4
Siu On Chan	4
Yiding Hua	4
Hongjie Chen	3
Johan Håstad	3
Mitali Bafna	3
Moritz Hardt	3
Thomas Holenstein	3
Parikshit Gopalan	3
Raghu Meka	3
Luca Trevisan	2
Ankur Moitra	2
Oded Regev	2
Ryan O’Donnell	2
John C. Wright	2
David Witmer	2
Aravindan Vijayaraghavan	2
Hongjie Chen	2
Tengyu Ma	2
Devarajan Sridharan	2
Jean–Bernard Lasserre	1
A.A. Wolters	1
Fernando G. S. L. Brandão	1
Vincent Cohen-Addad	1
Pablo A. Parrilo	1
Daniil Dmitriev	1
Aram W. Harrow	1
Jarosław Błasiok	1
Hongjie Chen	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming	1995	Michel X. Goemans David P. Williamson	18
+	Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization	2000	Pablo A. Parrilo	16
+ PDF Chat	Hypercontractivity, sum-of-squares proofs, and their applications	2012	Boaz Barak Fernando G. S. L. Brandão Aram W. Harrow Jonathan A. Kelner David Steurer Yuan Zhou	16
+	Global Optimization with Polynomials and the Problem of Moments	2001	Jean B. Lasserre	15
+ PDF Chat	Rounding Semidefinite Programming Hierarchies via Global Correlation	2011	Boaz Barak Prasad Raghavendra David Steurer	12
+ PDF Chat	Rounding sum-of-squares relaxations	2014	Boaz Barak Jonathan A. Kelner David Steurer	10
+	Sum-of-squares proofs and the quest toward optimal algorithms	2014	Boaz Barak David Steurer	10
+	Tensor principal component analysis via sum-of-square proofs.	2015	Samuel B. Hopkins Jonathan Shi David Steurer	9
+ PDF Chat	A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming	2003	Monique Laurent	9
+ PDF Chat	Expander flows, geometric embeddings and graph partitioning	2009	Sanjeev Arora Satish Rao Umesh Vazirani	8
+ PDF Chat	The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into \ell 1	2005	Subhash Khot Nisheeth K. Vishnoi	8
+	An approach to obtaining global extremums in polynomial mathematical programming problems	1988	N. Z. Shor	8
+	Tensor decompositions for learning latent variable models	2014	Animashree Anandkumar Rong Ge Daniel Hsu Sham M. Kakade Matus Telgarsky	8
+	Efficient Bayesian Estimation from Few Samples: Community Detection and Related Problems	2017	Samuel B. Hopkins David Steurer	7
+	Linear vs. semidefinite extended formulations	2012	Samuel Fiorini Serge Massar Sebastian Pokutta Hans Raj Tiwary Ronald de Wolf	7
+ PDF Chat	Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method	2015	Boaz Barak Jonathan A. Kelner David Steurer	7
+ PDF Chat	Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors	2016	Samuel B. Hopkins Tselil Schramm Jonathan Shi David Steurer	6
+	Making the Long Code Shorter	2012	Boaz Barak Parikshit Gopalan Johan Håstad Raghu Meka Prasad Raghavendra David Steurer	6
+	Analysis of Boolean Functions	2014	Ryan O’Donnell	6
+	Convergence of SDP hierarchies for polynomial optimization on the hypersphere	2012	Andrew C. Doherty Stephanie Wehner	6
+	A Spectral Algorithm for Latent Dirichlet Allocation	2012	Animashree Anandkumar Dean P. Foster Daniel Hsu Sham M. Kakade Yi-Kai Liu	6
+ PDF Chat	The Power of Sum-of-Squares for Detecting Hidden Structures	2017	Samuel B. Hopkins Pravesh K. Kothari Aaron Potechin Prasad Raghavendra Tselil Schramm David Steurer	6
+ PDF Chat	Smoothed analysis of tensor decompositions	2014	Aditya Bhaskara Moses Charikar Ankur Moitra Aravindan Vijayaraghavan	6
+	Sum-of-Squares Lower Bounds for Sparse PCA	2015	Tengyu Ma Avi Wigderson	6
+ PDF Chat	Lifts of Convex Sets and Cone Factorizations	2013	João Gouveia Pablo A. Parrilo Rekha R. Thomas	6
+	Achieving the KS threshold in the general stochastic block model with linearized acyclic belief propagation	2016	Emmanuel Abbé Colin Sandon	5
+	Semidefinite programs on sparse random graphs and their application to community detection	2016	Andrea Montanari Subhabrata Sen	5
+ PDF Chat	Fourier PCA and robust tensor decomposition	2014	Navin Goyal Santosh Vempala Ying Xiao	5
+ PDF Chat	Most Tensor Problems Are NP-Hard	2013	Christopher J. Hillar Lek‐Heng Lim	5
+	Analyzing Tensor Power Method Dynamics: Applications to Learning Overcomplete Latent Variable Models.	2014	Anima Anandkumar Rong Ge Majid Janzamin	5
+	A statistical model for tensor PCA	2014	Andrea Montanari Émile Richard	5
+ PDF Chat	Sums of Squares, Moment Matrices and Optimization Over Polynomials	2008	Monique Laurent	5
+	Exact Recovery of Sparsely-Used Dictionaries	2012	Daniel A. Spielman Huan Wang John Wright	5
+	Squared functional systems and optimization problems	2000	Yu. Nesterov	5
+	Complexity of Null- and Positivstellensatz proofs	2001	Dima Grigoriev Nicolai Vorobjov	5
+ PDF Chat	Introduction to the non-asymptotic analysis of random matrices	2012	Roman Vershynin	5
+	λ1, Isoperimetric inequalities for graphs, and superconcentrators	1985	Noga Alon Vitali Milman	5
+ PDF Chat	HIGH DIMENSIONAL ESTIMATION VIA SUM-OF-SQUARES PROOFS	2019	Prasad Raghavendra Tselil Schramm David Steurer	5
+ PDF Chat	Polynomial-Time Tensor Decompositions with Sum-of-Squares	2016	Tengyu Ma Jonathan Shi David Steurer	5
+ PDF Chat	How robust are reconstruction thresholds for community detection?	2016	Ankur Moitra William Bernard Perry Alexander S. Wein	5
+ PDF Chat	User-Friendly Tail Bounds for Sums of Random Matrices	2011	Joel A. Tropp	5
+ PDF Chat	The matching polytope has exponential extension complexity	2014	Thomas Rothvoß	5
+	Approximations for the isoperimetric and spectral profile of graphs and related parameters	2010	Prasad Raghavendra David Steurer Prasad Tetali	5
+ PDF Chat	Approximation Limits of Linear Programs (Beyond Hierarchies)	2012	Gábor Braun Samuel Fiorini Sebastian Pokutta David Steurer	5
+ PDF Chat	Reductions between Expansion Problems	2012	Prasad Raghavendra David Steurer Madhur Tulsiani	5
+	Foundations of the PARAFAC procedure: Models and conditions for an "explanatory" multi-model factor analysis	1970	Richard A. Harshman	5
+	Noise stability of functions with low influences: invariance and optimality	2005	Elchanan Mossel Ryan O’Donnell Krzysztof Oleszkiewicz	5
+	Mixture models, robustness, and sum of squares proofs	2018	Samuel B. Hopkins Jerry Li	5
+	Recovering the Sparsest Element in a Subspace	2013	Paul Hand Laurent Demanet	4
+	On the Shannon capacity of a graph	1979	László Lovász	4