| 2024 | Efficient Certificates of Anti-Concentration Beyond Gaussians. | Ainesh Bakshi, Pravesh K. Kothari, Goutham Rajendran, Madhur Tulsiani, Aravindan Vijayaraghavan |
| 2024 | Constant Degree Direct Product Testers with Small Soundness. | Mitali Bafna, Noam Lifshitz, Dor Minzer |
| 2024 | Trading Determinism for Noncommutativity in Edmonds' Problem. | Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay |
| 2024 | A Computational Test of Contextuality and, Even Simpler Proofs of Quantumness. | Atul Singh Arora, Kishor Bharti, Alexandru Cojocaru, Andrea Coladangelo |
| 2024 | Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles. | Omar Alrabiah, Venkatesan Guruswami |
| 2024 | Semi-Bandit Learning for Monotone Stochastic Optimization. | Arpit Agarwal, Rohan Ghuge, Viswanath Nagarajan |
| 2024 | Hardness of Packing, Covering and Partitioning Simple Polygons with Unit Squares. | Mikkel Abrahamsen, Jack Stade |
| 2024 | Constant-Depth Arithmetic Circuits for Linear Algebra Problems. | Robert Andrews, Avi Wigderson |
| 2024 | On Pigeonhole Principles and Ramsey in TFNP. | Siddhartha Jain, Jiawei Li, Robert Robere, Zhiyang Xun |
| 2024 | Spectral Guarantees for Adversarial Streaming PCA. | Eric Price, Zhiyang Xun |
| 2024 | Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric. | Zeyu Guo, Chaoping Xing, Chen Yuan, Zihan Zhang |
| 2024 | Towards Instance-Optimal Euclidean Spanners. | Hung Le, Shay Solomon, Cuong Than, Csaba D. Tth, Tianyi Zhang |
| 2024 | Fast Decision Tree Learning Solves Hard Coding-Theoretic Problems. | Caleb Koch, Carmen Strassle, Li-Yang Tan |
| 2024 | Hardness of Approximate Sperner and Applications to Envy-Free Cake Cutting. | Ruiquan Gao, Mohammad Roghani, Aviad Rubinstein, Amin Saberi |
| 2024 | Reverse Mathematics of Complexity Lower Bounds. | Lijie Chen, Jiatu Li, Igor C. Oliveira |
| 2024 | On Approximating Cutwidth and Pathwidth. | Nikhil Bansal, Dor Katzelnick, Roy Schwartz |
| 2024 | Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS. | Mohsen Ghaffari, Christoph Grunau |
| 2024 | Sensitivity Sampling for k-Means: Worst Case and Stability Optimal Coreset Bounds. | Nikhil Bansal, Vincent Cohen-Addad, Milind Prabhu, David Saulpic, Chris Schwiegelshohn |
| 2024 | The Tractability Border of Reachability in Simple Vector Addition Systems with States. | Dmitry Chistikov, Wojciech Czerwinski, Filip Mazowiecki, Lukasz Orlikowski, Henry Sinclair-Banks, Karol Wegrzycki |
| 2023 | Flip-width: Cops and Robber on dense graphs. | Szymon Torunczyk |
| 2023 | Improved Streaming Algorithms for Maximum Directed Cut via Smoothed Snapshots. | Raghuvansh R. Saxena, Noah G. Singer, Madhu Sudan, Santhoshini Velusamy |
| 2023 | Distribution of the threshold for the symmetric perceptron. | Ashwin Sah, Mehtaab Sawhney |
| 2023 | On Pseudolinear Codes for Correcting Adversarial Errors. | Eric Ruzomberka, Homa Nikbakht, Christopher G. Brinton, H. Vincent Poor |
| 2023 | Gilbert and Varshamov Meet Johnson: List-Decoding Explicit Nearly-Optimal Binary Codes. | Silas Richelson, Sourya Roy |
| 2023 | Clique Is Hard on Average for Unary Sherali-Adams. | Susanna F. de Rezende, Aaron Potechin, Kilian Risse |