| 2025 | Six Candidates Suffice to Win a Voter Majority. | Moses Charikar, Alexandra Lassota, Prasanna Ramakrishnan, Adrian Vetta, Kangning Wang |
| 2025 | How Random CSPs Fool Hierarchies: II. | Siu On Chan, Hiu Tsun Ng |
| 2025 | Optimal Rounding for Sparsest Cut. | Alan Chang, Assaf Naor, Kevin Ren |
| 2025 | Light Tree Covers, Routing, and Path-Reporting Oracles via Spanning Tree Covers in Doubling Graphs. | Hsien-Chih Chang, Jonathan Conroy, Hung Le, Shay Solomon, Cuong Than |
| 2025 | Learning the Sherrington-Kirkpatrick Model Even at Low Temperature. | Gautam Chandrasekaran, Adam R. Klivans |
| 2025 | Monotonicity Testing of High-Dimensional Distributions with Subcube Conditioning. | Deeparnab Chakrabarty, Xi Chen, Simeon Ristic, C. Seshadhri, Erik Waingarten |
| 2025 | Quantum Advantage from Soft Decoders. | Andr Chailloux, Jean-Pierre Tillich |
| 2025 | Output-Sensitive Approximate Counting via a Measure-Bounded Hyperedge Oracle, or: How Asymmetry Helps Estimate k-Clique Counts Faster. | Keren Censor-Hillel, Tomer Even, Virginia Vassilevska Williams |
| 2025 | Network Unreliability in Almost-Linear Time. | Ruoxu Cen, Jason Li, Debmalya Panigrahi |
| 2025 | Solving the Correlation Cluster LP in Sublinear Time. | Nairen Cao, Vincent Cohen-Addad, Euiwoong Lee, Shi Li, David Rasmussen Lolck, Alantha Newman, Mikkel Thorup, Lukas Vogl, Shuyi Yan, Hanwen Zhang |
| 2025 | Extending the Extension: Deterministic Algorithm for Non-monotone Submodular Maximization. | Niv Buchbinder, Moran Feldman |
| 2025 | A Fine-Grained Classification of Subquadratic Patterns for Subgraph Listing and Friends. | Karl Bringmann, Egor Gorbachev |
| 2025 | Optimality of Frequency Moment Estimation. | Mark Braverman, Or Zamir |
| 2025 | Redundancy Is All You Need. | Joshua Brakensiek, Venkatesan Guruswami |
| 2025 | Faster Distributed Δ-Coloring via Ruling Subgraphs. | Yann Bourreau, Sebastian Brandt, Alexandre Nolin |
| 2025 | The State Hidden Subgroup Problem and an Efficient Algorithm for Locating Unentanglement. | Adam Bouland, Tudor Giurgica-Tiron, John Wright |
| 2025 | A General Quantum Duality for Representations of Groups with Applications to Quantum Money, Lightning, and Fire. | John Bostanci, Barak Nehoran, Mark Zhandry |
| 2025 | A 5/4-Approximation for Two-Edge Connectivity. | Miguel Bosch-Calvo, Mohit Garg, Fabrizio Grandoni, Felix Hommelsheim, Afrouz Jabal Ameli, Alexander Lindermayr |
| 2025 | Treewidth Inapproximability and Tight ETH Lower Bound. | douard Bonnet |
| 2025 | ptimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs. | Itai Boneh, Shiri Chechik, Shay Golan, Shay Mozes, Oren Weimann |
| 2025 | Global vs. s-t Vertex Connectivity Beyond Sequential: Almost-Perfect Reductions and Near-Optimal Separations. | Joakim Blikstad, Yonggang Jiang, Sagnik Mukhopadhyay, Sorrachai Yingchareonthawornchai |
| 2025 | Adaptive and Oblivious Statistical Adversaries Are Equivalent. | Guy Blanc, Gregory Valiant |
| 2025 | Agnostic Smoothed Online Learning. | Mose Blanchard |
| 2025 | Reachability in One-Dimensional Pushdown Vector Addition Systems Is Decidable. | Clotilde Bizire, Wojciech Czerwinski |
| 2025 | Fully Dynamic k-Median with Near-Optimal Update Time and Recourse. | Sayan Bhattacharya, Martn Costa, Ermiya Farokhnejad |