| 2026 | COLT | Polynomial-time sampling despite disorder chaos. | Eric Ma, Tselil Schramm |
| 2025 | COLT | Some easy optimization problems have the overlap-gap property. | Shuangping Li, Tselil Schramm |
| 2025 | STOC | Fast, Robust Approximate Message Passing. | Misha Ivkov, Tselil Schramm |
| 2025 | STOC | Discrepancy Algorithms for the Binary Perceptron. | Shuangping Li, Tselil Schramm, Kangjie Zhou |
| 2024 | STOC | Semidefinite Programs Simulate Approximate Message Passing Robustly. | Misha Ivkov, Tselil Schramm |
| 2023 | STOC | Local and Global Expansion in Random Geometric Graphs. | Siqi Liu, Sidhanth Mohanty, Tselil Schramm, Elizabeth Yang |
| 2022 | ICALP | The SDP Value of Random 2CSPs. | Amulya Musipatla, Ryan O'Donnell, Tselil Schramm, Xinyu Wu |
| 2022 | STOC | Testing thresholds for high-dimensional sparse random geometric graphs. | Siqi Liu, Sidhanth Mohanty, Tselil Schramm, Elizabeth Yang |
| 2021 | COLT | Statistical Query Algorithms and Low Degree Tests Are Almost Equivalent. | Matthew S. Brennan, Guy Bresler, Samuel B. Hopkins, Jerry Li, Tselil Schramm |
| 2021 | COLT | Non-asymptotic approximations of neural networks by Gaussian processes. | Ronen Eldan, Dan Mikulincer, Tselil Schramm |
| 2021 | STOC | Playing unique games on certified small-set expanders. | Mitali Bafna, Boaz Barak, Pravesh K. Kothari, Tselil Schramm, David Steurer |
| 2020 | FOCS | Subexponential LPs Approximate Max-Cut. | Samuel B. Hopkins, Tselil Schramm, Luca Trevisan |
| 2019 | COLT | A Robust Spectral Algorithm for Overcomplete Tensor Decomposition. | Samuel B. Hopkins, Tselil Schramm, Jonathan Shi |
| 2019 | SODA | The threshold for SDP-refutation of random regular NAE-3SAT. | Yash Deshpande, Andrea Montanari, Ryan O'Donnell, Tselil Schramm, Subhabrata Sen |
| 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 | STOC | Strongly refuting random CSPs below the spectral threshold. | Prasad Raghavendra, Satish Rao, Tselil Schramm |
| 2016 | SODA | On the Integrality Gap of Degree-4 Sum of Squares for Planted Clique. | Samuel B. Hopkins, Pravesh Kothari, Aaron Henry Potechin, Prasad Raghavendra, Tselil Schramm |
| 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 | STOC | Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs. | Shuchi Chawla, Konstantin Makarychev, Tselil Schramm, Grigory Yaroslavtsev |