| 2024 | Optimal Tradeoffs for Estimating Pauli Observables. | Sitan Chen, Weiyuan Gong, Qi Ye |
| 2024 | Efficient Unitary Designs from Random Sums and Permutations. | Chi-Fang Chen, Jordan Docter, Michelle Xu, Adam Bouland, Fernando G. S. L. Brando, Patrick Hayden |
| 2024 | Stochastic Online Correlated Selection. | Ziyun Chen, Zhiyi Huang, Enze Sun |
| 2024 | On the Existence of Seedless Condensers: Exploring the Terrain. | Eshan Chattopadhyay, Mohit Gurumukhani, Noam Ringach |
| 2024 | The Bidirected Cut Relaxation for Steiner Tree has Integrality Gap Smaller Than 2. | Jaroslaw Byrka, Fabrizio Grandoni, Vera Traub |
| 2024 | Deterministic Algorithm and Faster Algorithm for Submodular Maximization Subject to a Matroid Constraint. | Niv Buchbinder, Moran Feldman |
| 2024 | Tight Analyses of Ordered and Unordered Linear Probing. | Mark Braverman, William Kuszmaul |
| 2024 | Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality. | Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Simon Meierhans, Maximilian Probst Gutenberg, Sushant Sachdeva |
| 2024 | Semirandom Planted Clique and the Restricted Isometry Property. | Jaroslaw Blasiok, Rares-Darius Buhai, Pravesh K. Kothari, David Steurer |
| 2024 | Gradient Descent is Pareto-Optimal in the Oracle Complexity and Memory Tradeoff for Feasibility Problems. | Mose Blanchard |
| 2024 | The Sample Complexity of Smooth Boosting and the Tightness of the Hardcore Theorem. | Guy Blanc, Alexandre Hayderi, Caleb Koch, Li-Yang Tan |
| 2024 | Dot-Product Proofs and Their Applications. | Nir Bitansky, Prahladh Harsha, Yuval Ishai, Ron D. Rothblum, David J. Wu |
| 2024 | Improved Distance (Sensitivity) Oracles with Subquadratic Space. | Davide Bil, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck |
| 2024 | Fully Dynamic k-Clustering with Fast Update Time and Small Recourse. | Sayan Bhattacharya, Martn Costa, Naveen Garg, Silvio Lattanzi, Nikos Parotsidis |
| 2024 | Faster (Δ+1)-Edge Coloring: Breaking the m√n Time Barrier. | Sayan Bhattacharya, Din Carmon, Martn Costa, Shay Solomon, Tianyi Zhang |
| 2024 | Maximum Flow by Augmenting Paths in n | Aaron Bernstein, Joakim Blikstad, Thatchaphol Saranurak, Ta-Wei Tu |
| 2024 | Quantum Computational Advantage with Constant-Temperature Gibbs Sampling. | Thiago Bergamaschi, Chi-Fang Chen, Yunchao Liu |
| 2024 | Tight Bounds for Classical Open Addressing. | Michael A. Bender, William Kuszmaul, Renfei Zhou |
| 2024 | Nearly Optimal List Labeling. | Michael A. Bender, Alex Conway, Martn Farach-Colton, Hanna Komls, Michal Kouck, William Kuszmaul, Michael E. Saks |
| 2024 | O(1) Insertion for Random Walk d-ary Cuckoo Hashing up to the Load Threshold. | Tolson Bell, Alan M. Frieze |
| 2024 | Fully Dynamic Matching and Ordered Ruzsa-Szemerdi Graphs. | Soheil Behnezhad, Alma Ghafari |
| 2024 | Commitments are Equivalent to Statistically-Verifiable One-Way State Generators. | Rishabh Batra, Rahul Jain |
| 2024 | Novel Properties of Hierarchical Probabilistic Partitions and Their Algorithmic Applications. | Sandip Banerjee, Yair Bartal, Lee-Ad Gottlieb, Alon Hovav |
| 2024 | Structure Learning of Hamiltonians from Real-Time Evolution. | Ainesh Bakshi, Allen Liu, Ankur Moitra, Ewin Tang |
| 2024 | High-Temperature Gibbs States are Unentangled and Efficiently Preparable. | Ainesh Bakshi, Allen Liu, Ankur Moitra, Ewin Tang |