| 2024 | Randomly Punctured Reed-Solomon Codes Achieve List-Decoding Capacity over Linear-Sized Fields. | Omar Alrabiah, Venkatesan Guruswami, Ray Li |
| 2024 | Tight Time-Space Tradeoffs for the Decisional Diffie-Hellman Problem. | Akshima, Tyler Besselman, Siyao Guo, Zhiye Xie, Yuping Ye |
| 2024 | Prize-Collecting Steiner Tree: A 1.79 Approximation. | Ali Ahmadi, Iman Gholami, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Mohammad Mahdavi |
| 2024 | Minimum Star Partitions of Simple Polygons in Polynomial Time. | Mikkel Abrahamsen, Joakim Blikstad, Andr Nusser, Hanwen Zhang |
| 2024 | New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms. | Amir Abboud, Nick Fischer, Zander Kelley, Shachar Lovett, Raghu Meka |
| 2024 | Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow. | Li Chen, Rasmus Kyng, Yang P. Liu, Simon Meierhans, Maximilian Probst Gutenberg |
| 2024 | A Nearly Quadratic-Time FPTAS for Knapsack. | Lin Chen, Jiayi Lian, Yuchen Mao, Guochuan Zhang |
| 2024 | Strong Algebras and Radical Sylvester-Gallai Configurations. | Rafael Oliveira, Akash Kumar Sengupta |
| 2024 | Almost Linear Size Edit Distance Sketch. | Michal Kouck, Michael E. Saks |
| 2024 | Shaving Logs via Large Sieve Inequality: Faster Algorithms for Sparse Convolution and More. | Ce Jin, Yinzhan Xu |
| 2024 | Lenzen's Distributed Routing Generalized: A Full Characterization of Constant-Time Routability. | Mohsen Ghaffari, Brandon Wang |
| 2024 | Approximate Earth Mover's Distance in Truly-Subquadratic Time. | Lorenzo Beretta, Aviad Rubinstein |
| 2024 | The Power of Two-Sided Recruitment in Two-Sided Markets. | Yang Cai, Christopher Liaw, Aranyak Mehta, Mingfei Zhao |
| 2024 | Approximating Small Sparse Cuts. | Aditya Anand, Euiwoong Lee, Jason Li, Thatchaphol Saranurak |
| 2024 | Symmetric Exponential Time Requires Near-Maximum Circuit Size. | Lijie Chen, Shuichi Hirahara, Hanlin Ren |
| 2024 | Classical Simulation of Peaked Shallow Quantum Circuits. | Sergey Bravyi, David Gosset, Yinchen Liu |
| 2024 | Work-Efficient Parallel Derandomization II: Optimal Concentrations via Bootstrapping. | Mohsen Ghaffari, Christoph Grunau |
| 2024 | Dynamic O(Arboricity) Coloring in Polylogarithmic Worst-Case Time. | Mohsen Ghaffari, Christoph Grunau |
| 2024 | Local Borsuk-Ulam, Stability, and Replicability. | Zachary Chase, Bogdan Chornomaz, Shay Moran, Amir Yehudayoff |
| 2024 | Random (log n)-CNF Are Hard for Cutting Planes (Again). | Dmitry Sokolov |
| 2023 | Algorithmic Applications of Hypergraph and Partition Containers. | Or Zamir |
| 2023 | New Subset Selection Algorithms for Low Rank Approximation: Offline and Online. | David P. Woodruff, Taisuke Yasuda |
| 2023 | Average-Case Complexity of Tensor Decomposition for Low-Degree Polynomials. | Alexander S. Wein |
| 2023 | Interior Point Methods with a Gradient Oracle. | Adrian Vladu |
| 2023 | Concurrent Composition Theorems for Differential Privacy. | Salil P. Vadhan, Wanrong Zhang |