Gap Amplification for Small-Set Expansion via Random Walks. - Prasad Raghavendra; Tselil Schramm (APPROX-RANDOM, 2014)

Near Optimal LP Rounding Algorithm for Correlation Clustering on Complete and Complete k-partite Graphs. - Shuchi Chawla 001; Konstantin Makarychev; Tselil Schramm; Grigory Yaroslavtsev (CoRR, 2014)

Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs. - Shuchi Chawla 001; Konstantin Makarychev; Tselil Schramm; Grigory Yaroslavtsev (STOC, 2015)

Speeding up sum-of-squares for tensor decomposition and planted sparse vectors. - Samuel B. Hopkins 001; Tselil Schramm; Jonathan Shi; David Steurer (CoRR, 2015)

Tight Lower Bounds for Planted Clique in the Degree-4 SOS Program. - Prasad Raghavendra; Tselil Schramm (CoRR, 2015)

Low-Rank Matrix Completion with Adversarial Missing Entries. - Tselil Schramm; Benjamin Weitz (CoRR, 2015)

Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors. - Samuel B. Hopkins 001; Tselil Schramm; Jonathan Shi; David Steurer (STOC, 2016)

Global and Local Information in Clustering Labeled Block Models. - Varun Kanade; Elchanan Mossel; Tselil Schramm (IEEE Trans. Inf. Theory, 2016)

Fast and robust tensor decomposition with applications to dictionary learning. - Tselil Schramm; David Steurer (COLT, 2017)

The Power of Sum-of-Squares for Detecting Hidden Structures. - Samuel B. Hopkins 001; Pravesh K. Kothari; Aaron Potechin; Prasad Raghavendra; Tselil Schramm; David Steurer (FOCS, 2017)

Strongly refuting random CSPs below the spectral threshold. - Prasad Raghavendra; Satish Rao; Tselil Schramm (STOC, 2017)

Braess's paradox for the spectral gap in random graphs and delocalization of eigenvectors. - Ronen Eldan; Miklós Z. Rácz; Tselil Schramm (Random Struct. Algorithms, 2017)

Random Matrices and the Sum-of-Squares Hierarchy. - Tselil Schramm (2017)

Computing Exact Minimum Cuts Without Knowing the Graph. - Aviad Rubinstein; Tselil Schramm; S. Matthew Weinberg (ITCS, 2018)

High-dimensional estimation via sum-of-squares proofs. - Prasad Raghavendra; Tselil Schramm; David Steurer (CoRR, 2018)

On the Integrality Gap of Degree-4 Sum of Squares for Planted Clique. - Samuel B. Hopkins 001; Pravesh Kothari; Aaron Henry Potechin; Prasad Raghavendra; Tselil Schramm (ACM Trans. Algorithms, 2018)

A Robust Spectral Algorithm for Overcomplete Tensor Decomposition. - Samuel B. Hopkins 001; Tselil Schramm; Jonathan Shi (COLT, 2019)

SOS Lower Bounds with Hard Constraints: Think Global, Act Local. - Pravesh K. Kothari; Ryan O'Donnell; Tselil Schramm (ITCS, 2019)

(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs. - Boaz Barak; Chi-Ning Chou; Zhixian Lei; Tselil Schramm; Yueqi Sheng (NeurIPS, 2019)

The threshold for SDP-refutation of random regular NAE-3SAT. - Yash Deshpande; Andrea Montanari; Ryan O'Donnell; Tselil Schramm; Subhabrata Sen (SODA, 2019)

Subexponential LPs Approximate Max-Cut. - Samuel B. Hopkins 001; Tselil Schramm; Luca Trevisan 001 (FOCS, 2020)

Computational Barriers to Estimation from Low-Degree Polynomials. - Tselil Schramm; Alexander S. Wein (CoRR, 2020)

Statistical Query Algorithms and Low Degree Tests Are Almost Equivalent. - Matthew S. Brennan; Guy Bresler; Samuel B. Hopkins 001; Jerry Li 001; Tselil Schramm (COLT, 2021)

Non-asymptotic approximations of neural networks by Gaussian processes. - Ronen Eldan; Dan Mikulincer; Tselil Schramm (COLT, 2021)

The Strongish Planted Clique Hypothesis and Its Consequences. - Pasin Manurangsi; Aviad Rubinstein; Tselil Schramm (ITCS, 2021)

Robust Regression Revisited: Acceleration and Improved Estimation Rates. - Arun Jambulapati; Jerry Li 001; Tselil Schramm; Kevin Tian (NeurIPS, 2021)

Playing unique games on certified small-set expanders. - Mitali Bafna; Boaz Barak; Pravesh K. Kothari; Tselil Schramm; David Steurer (STOC, 2021)

Sherali-Adams Strikes Back. - Ryan O'Donnell; Tselil Schramm (Adv. Math. Commun., 2021)

The SDP Value of Random 2CSPs. - Amulya Musipatla; Ryan O'Donnell; Tselil Schramm; Xinyu Wu (ICALP, 2022)

The Franz-Parisi Criterion and Computational Trade-offs in High Dimensional Statistics. - Afonso S. Bandeira; Ahmed El Alaoui; Samuel B. Hopkins 001; Tselil Schramm; Alexander S. Wein; Ilias Zadik (NeurIPS, 2022)

Testing thresholds for high-dimensional sparse random geometric graphs. - Siqi Liu 005; Sidhanth Mohanty; Tselil Schramm; Elizabeth Yang (STOC, 2022)

Local and Global Expansion in Random Geometric Graphs. - Siqi Liu 005; Sidhanth Mohanty; Tselil Schramm; Elizabeth Yang (STOC, 2023)

Spectral clustering in the Gaussian mixture block model. - Shuangping Li; Tselil Schramm (CoRR, 2023)

Semidefinite Programs Simulate Approximate Message Passing Robustly. - Misha Ivkov; Tselil Schramm (STOC, 2024)

Some easy optimization problems have the overlap-gap property. - Shuangping Li; Tselil Schramm (COLT, 2025)

Fast, Robust Approximate Message Passing. - Misha Ivkov; Tselil Schramm (STOC, 2025)

Discrepancy Algorithms for the Binary Perceptron. - Shuangping Li; Tselil Schramm; Kangjie Zhou (STOC, 2025)

Polynomial-time sampling despite disorder chaos. - Eric Ma; Tselil Schramm (CoRR, 2025)