T. Schramm

Most-cited papers

An Extreme Case of Plant–Insect Codiversification: Figs and Fig-Pollinating Wasps
A. Cruaud, N. Rønsted, Bhanumas Chantarasuwan, Lien-Siang Chou +25 more
2012Systematic Biology358 citations Open access
Semantic Scholar
The Power of Sum-of-Squares for Detecting Hidden Structures
Samuel B. Hopkins, Pravesh Kothari, Aaron Potechin, P. Raghavendra +2 more
2017IEEE Annual Symposium on Foundations of Computer Science164 citations Open access
Semantic Scholar
Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors
Samuel B. Hopkins, T. Schramm, Jonathan Shi, David Steurer
2015Symposium on the Theory of Computing153 citations Open access
Semantic Scholar
Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs
Shuchi Chawla, K. Makarychev, T. Schramm, G. Yaroslavtsev
2014Symposium on the Theory of Computing146 citations Open access
Semantic Scholar
Computational Barriers to Estimation from Low-Degree Polynomials
T. Schramm, Alexander S. Wein
2020Annals of Statistics99 citations Open access
Semantic Scholar
Strongly refuting random CSPs below the spectral threshold
P. Raghavendra, Satish B. Rao, T. Schramm
2016Symposium on the Theory of Computing98 citations
Semantic Scholar
Statistical Query Algorithms and Low-Degree Tests Are Almost Equivalent
Matthew S. Brennan, Guy Bresler, Samuel B. Hopkins, J. Li +1 more
2020Annual Conference Computational Learning Theory87 citations
Semantic Scholar
(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs
B. Barak, Chi-Ning Chou, Zhixian Lei, T. Schramm +1 more
2018Neural Information Processing Systems76 citations
Semantic Scholar
Computing Exact Minimum Cuts Without Knowing the Graph
A. Rubinstein, T. Schramm, S. Weinberg
2017Information Technology Convergence and Services69 citations
Semantic Scholar
High-dimensional estimation via sum-of-squares proofs
P. Raghavendra, T. Schramm, David Steurer
2018International Congress of Mathematicans67 citations Open access
Semantic Scholar
The Franz-Parisi Criterion and Computational Trade-offs in High Dimensional Statistics
A. Bandeira, A. El Alaoui, Samuel B. Hopkins, T. Schramm +2 more
2022Neural Information Processing Systems51 citations Open access
Semantic Scholar
Fast and robust tensor decomposition with applications to dictionary learning
T. Schramm, David Steurer
2017Annual Conference Computational Learning Theory47 citations
Semantic Scholar
Global and Local Information in Clustering Labeled Block Models
Varun Kanade, Elchanan Mossel, T. Schramm
2014IEEE Transactions on Information Theory43 citations Open access
Semantic Scholar
Testing thresholds for high-dimensional sparse random geometric graphs
Siqi Liu, Sidhanth Mohanty, T. Schramm, E. Yang
2021Symposium on the Theory of Computing39 citations
Semantic Scholar
On the Integrality Gap of Degree-4 Sum of Squares for Planted Clique
Samuel B. Hopkins, Pravesh Kothari, Aaron Potechin, P. Raghavendra +1 more
2016ACM-SIAM Symposium on Discrete Algorithms39 citations
Semantic Scholar
The Strongish Planted Clique Hypothesis and Its Consequences
Pasin Manurangsi, A. Rubinstein, T. Schramm
2020Information Technology Convergence and Services35 citations
Semantic Scholar
Non-asymptotic approximations of neural networks by Gaussian processes
Ronen Eldan, Dan Mikulincer, T. Schramm
2021Annual Conference Computational Learning Theory28 citations
Semantic Scholar
Playing unique games on certified small-set expanders
Mitali Bafna, B. Barak, Pravesh Kothari, T. Schramm +1 more
2020Symposium on the Theory of Computing28 citations Open access
Semantic Scholar
Tight Lower Bounds for Planted Clique in the Degree-4 SOS Program
P. Raghavendra, T. Schramm
2015arXiv.org27 citations
Semantic Scholar
A Robust Spectral Algorithm for Overcomplete Tensor Decomposition
Samuel B. Hopkins, T. Schramm, Jonathan Shi
2019Annual Conference Computational Learning Theory26 citations Open access
Semantic Scholar
Braess's paradox for the spectral gap in random graphs and delocalization of eigenvectors
Ronen Eldan, Miklós Z. Rácz, T. Schramm
2015Random Struct. Algorithms24 citations Open access
Semantic Scholar
The threshold for SDP-refutation of random regular NAE-3SAT
Y. Deshpande, A. Montanari, R. O'Donnell, T. Schramm +1 more
2018ACM-SIAM Symposium on Discrete Algorithms22 citations Open access
Semantic Scholar
Discrepancy Algorithms for the Binary Perceptron
Shuang-Ping Li, T. Schramm, Kangjie Zhou
2024Symposium on the Theory of Computing21 citations Open access
Semantic Scholar
Some easy optimization problems have the overlap-gap property
Shuang-Ping Li, T. Schramm
2024Annual Conference Computational Learning Theory18 citations
Semantic Scholar
Robust Regression Revisited: Acceleration and Improved Estimation Rates
Arun Jambulapati, J. Li, T. Schramm, Kevin Tian
2021Neural Information Processing Systems18 citations
Semantic Scholar
Spectral clustering in the Gaussian mixture block model
Shuang-Ping Li, T. Schramm
2023arXiv.org15 citations Open access
Semantic Scholar
Semidefinite Programs Simulate Approximate Message Passing Robustly
Misha Ivkov, T. Schramm
2023Symposium on the Theory of Computing13 citations Open access
Semantic Scholar
Speeding up sum-of-squares for tensor decomposition and planted sparse vectors
Samuel B. Hopkins, T. Schramm, Jonathan Shi, David Steurer
2015arXiv.org12 citations
Semantic Scholar
Local and Global Expansion in Random Geometric Graphs
Siqi Liu, Sidhanth Mohanty, T. Schramm, E. Yang
2022Symposium on the Theory of Computing10 citations Open access
Semantic Scholar
Subexponential LPs Approximate Max-Cut
Samuel B. Hopkins, T. Schramm, L. Trevisan
2019IEEE Annual Symposium on Foundations of Computer Science10 citations Open access
Semantic Scholar
Sherali-adams strikes back
R. O'Donnell, T. Schramm
2018Cybersecurity and Cyberforensics Conference10 citations
Semantic Scholar
HMC CS Technical Report CS-2011-1: Faster Dynamic Programming Algorithms for the Cophylogeny Reconstruction Problem
Anak Yodpinyanee, Benjamin Cousins, John Peebles, T. Schramm +1 more
20119 citations
Semantic Scholar
SOS lower bounds with hard constraints: think global, act local
Pravesh Kothari, R. O'Donnell, T. Schramm
2018Information Technology Convergence and Services7 citations
Semantic Scholar
Low-Rank Matrix Completion with Adversarial Missing Entries
T. Schramm, B. Weitz
2015arXiv.org7 citations
Semantic Scholar
Gap Amplification for Small-Set Expansion via Random Walks
P. Raghavendra, T. Schramm
2013International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques7 citations
Semantic Scholar
Fast, Robust Approximate Message Passing
Misha Ivkov, T. Schramm
2024Symposium on the Theory of Computing5 citations Open access
Semantic Scholar
The statistical threshold for planted matchings and spanning trees
L. Addario-Berry, Omer Angel, Gábor Lugosi, Mikl'os Z. R'acz +1 more
20264 citations
Semantic Scholar
A : Advanced Statistical Theory The Sum-of-Squares Algorithmic Paradigm in Statistics Instructor :
T. Schramm
20223 citations
Semantic Scholar
Random Matrices and the Sum-of-Squares Hierarchy
T. Schramm
20172 citations
Semantic Scholar
Symmetric Tensor Completion from Multilinear Entries and Learning Product Mixtures over the Hypercube
T. Schramm, B. Weitz
20152 citations
Semantic Scholar
Polynomial-time sampling despite disorder chaos
Eric Ma, T. Schramm
2025Annual Conference Computational Learning Theory1 citations
Semantic Scholar
Lecture 5: Approximate Sampling of Spanning Trees via Matroid Basis Exchange
T. Schramm
20221 citations
Semantic Scholar
Literature of Statistics The Sum-of-Squares Algorithmic Paradigm in Statistics
T. Schramm, K. Tian
20211 citations
Semantic Scholar
Averaged Annealed Markov Chains Achieve the Algorithmic Threshold for Tensor PCA, Part I: Glauber Dynamics
Aniket Das, T. Schramm
20260 citations
Semantic Scholar
Easy, robust approximate message passing for planted spike models
Misha Ivkov, T. Schramm
2026arXiv.org0 citations
Semantic Scholar
High-Dimensional Procrustes Matching via Tree Counts
Xiaochun Niu, T. Schramm, Jia-Ming Xu
2026arXiv.org0 citations
Semantic Scholar
Algorithms for adaptive and heteroskedastic linear regression at the computational threshold
Spencer Compton, T. Schramm
20260 citations
Semantic Scholar
Special Section on the Fifty-Third Annual ACM Symposium on the Theory of Computing (STOC 2021)
Greg Bodwin, T. Schramm, Aleksandar Nikolov, N. Limaye +1 more
2026SIAM journal on computing (Print)0 citations
Semantic Scholar
Testing Thresholds for High-Dimensional Sparse Random Geometric Graphs
Siqi Liu, Sidhanth Mohanty, T. Schramm, Elizabeth Yang
2024SIAM journal on computing (Print)0 citations Open access
Semantic Scholar
Lecture 4: Clustering well-separated Gaussian mixtures
T. Schramm
20220 citations
Semantic Scholar