| 2026 | Improved Approximation Algorithms for Non-preemptive Throughput Maximization. | Alexander Armbruster, Fabrizio Grandoni, Antoine Tinguely, Andreas Wiese |
| 2026 | Learning Read-Once Determinants and the Principal Minor Assignment Problem. | Abhiram Aravind, Abhranil Chatterjee, Sumanta Ghosh, Rohit Gurjar, Roshan Raj, Chandan Saha |
| 2026 | Approximate Orthogonal Vectors and Diameter via Regularity Lemma. | Alexandr Andoni, Shunhua Jiang, Stepan Zharkov |
| 2026 | Parallel Sampling via Autospeculation. | Nima Anari, Carlo Baronio, CJ Chen, Alireza Haqi, Frederic Koehler, Anqi Li, Thuy-Duong Vuong |
| 2026 | Ideals, Macaulay Bases, and PCPs. | Prashanth Amireddy, Amik Raj Behera, Srikanth Srinivasan, Madhu Sudan, Sophus Valentin Willumsgaard |
| 2026 | Shifted Composition IV: Toward Ballistic Acceleration for Log-Concave Sampling. | Jason M. Altschuler, Sinho Chewi, Matthew S. Zhang |
| 2026 | Learning Functions of Halfspaces. | Josh Alman, Shyamal Patel, Rocco A. Servedio |
| 2026 | Sampling Permutations with Cell Probes Is Hard. | Yaroslav Alekseev, Mika Gs, Konstantin Myasnikov, Artur Riazanov, Dmitry Sokolov |
| 2026 | Monte Carlo to Las Vegas for Recursively Composed Functions. | Bandar Al-Dhalaan, Shalev Ben-David |
| 2026 | First-Order (Coarse) Correlated Equilibria in Non-concave Games. | Mete Seref Ahunbay |
| 2026 | Generalized Samorodnitsky Noisy Function Inequalities, with Applications to Error-Correcting Codes. | Olakunle Sunday Abawonse, Jan Hazla, Ryan O'Donnell |
| 2025 | Learning the Structure of Any Hamiltonian from Minimal Assumptions. | Andrew Zhao |
| 2025 | Simulating Time with Square-Root Space. | R. Ryan Williams |
| 2025 | Harmonic Decomposition in Data Sketches. | Dingyu Wang |
| 2025 | Breaking the Barrier of Self-Concordant Barriers: Faster Interior Point Methods for M-Matrices. | Adrian Vladu |
| 2025 | Symmetric Perceptrons, Number Partitioning and Lattices. | Neekon Vafa, Vinod Vaikuntanathan |
| 2025 | Faster Rates for No-Regret Learning in General Games via Cautious Optimism. | Ashkan Soleymani, Georgios Piliouras, Gabriele Farina |
| 2025 | Sharp Phase Transitions in Estimation with Low-Degree Polynomials. | Youngtak Sohn, Alexander S. Wein |
| 2025 | Dimension Independent and Computationally Efficient Shadow Tomography. | Pulkit Sinha |
| 2025 | Better Approximation for Weighted k-Matroid Intersection. | Neta Singer, Theophile Thiery |
| 2025 | A Tolerant Independent Set Tester. | Cameron Seth |
| 2025 | Strong XOR Lemma for Information Complexity. | Pachara Sawettamalya, Huacheng Yu |
| 2025 | Efficient Thermalization and Universal Quantum Computing with Quantum Gibbs Samplers. | Cambyse Rouz, Daniel Stilck Frana, lvaro M. Alhambra |
| 2025 | A Generalized Trace Reconstruction Problem: Recovering a String of Probabilities. | Joey Rivkin, Gregory Valiant, Paul Valiant |
| 2025 | Truly Supercritical Trade-Offs for Resolution, Cutting Planes, Monotone Circuits, and Weisfeiler-Leman. | Susanna F. de Rezende, Noah Fleming, Duri Andrea Janett, Jakob Nordstrm, Shuo Pang |