| 2024 | Faster Rectangular Matrix Multiplication by Combination Loss Analysis. | Franois Le Gall |
| 2024 | Learning Hard-Constrained Models with One Sample. | Andreas Galanis, Alkis Kalavasis, Anthimos Vardis Kandiros |
| 2024 | Tree Containment Above Minimum Degree is FPT. | Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov |
| 2024 | A Distributed Palette Sparsification Theorem. | Maxime Flin, Mohsen Ghaffari, Magns M. Halldrsson, Fabian Kuhn, Alexandre Nolin |
| 2024 | On Approximability of Steiner Tree in | Henry L. Fleischmann, Surya Teja Gavva, Karthik C. S. |
| 2024 | The Effect of Sparsity on | Nick Fischer, Marvin Knnemann, Mirza Redzic |
| 2024 | Deterministic Sparse Pattern Matching via the Baur-Strassen Theorem. | Nick Fischer |
| 2024 | On Deterministically Approximating Total Variation Distance. | Weiming Feng, Liqiang Liu, Tianren Liu |
| 2024 | Rationality-Robust Information Design: Bayesian Persuasion under Quantal Response. | Yiding Feng, Chien-Ju Ho, Wei Tang |
| 2024 | Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations. | Baris Can Esmer, Ariel Kulik, Dniel Marx, Daniel Neuen, Roohani Sharma |
| 2024 | Deterministic Byzantine Agreement with Adaptive | Fatima Elsheimy, Giorgos Tsimos, Charalampos Papamanthou |
| 2024 | Determinantal Sieving. | Eduard Eiben, Tomohiro Koana, Magnus Wahlstrm |
| 2024 | Combinatorial Contracts Beyond Gross Substitutes. | Paul Dtting, Michal Feldman, Yoav Gal Tzur |
| 2024 | The Grid-Minor Theorem Revisited. | Vida Dujmovic, Robert Hickingbotham, Jedrzej Hodor, Gwenal Joret, Hoang La, Piotr Micek, Pat Morin, Clment Rambaud, David R. Wood |
| 2024 | Edge-disjoint paths in expanders: online with removals. | Nemanja Draganic, Rajko Nenadov |
| 2024 | Fast 2-Approximate All-Pairs Shortest Paths. | Michal Dory, Sebastian Forster, Yael Kirkpatrick, Yasamin Nazari, Virginia Vassilevska Williams, Tijn de Vos |
| 2024 | Fast Algorithms for Separable Linear Programs. | Sally Dong, Gramoz Goranci, Lawrence Li, Sushant Sachdeva, Guanghao Ye |
| 2024 | The Identity Problem in nilpotent groups of bounded class. | Ruiwen Dong |
| 2024 | Time-Space Lower Bounds for Bounded-Error Computation in the Random-Query Model. | Itai Dinur |
| 2024 | Controlling Tail Risk in Online Ski-Rental. | Michael Dinitz, Sungjin Im, Thomas Lavastida, Benjamin Moseley, Sergei Vassilvitskii |
| 2024 | Edge-Coloring Algorithms for Bounded Degree Multigraphs. | Abhishek Dhawan |
| 2024 | Grammar Boosting: A New Technique for Proving Lower Bounds for Computation over Compressed Data. | Rajat De, Dominik Kempa |
| 2024 | Integer Programming with GCD Constraints. | Rmy Dfossez, Christoph Haase, Alessio Mansutti, Guillermo A. Prez |
| 2024 | Strongly Polynomial Frame Scaling to High Precision. | Daniel Dadush, Akshay Ramachandran |
| 2024 | Count on CFI graphs for #P-hardness. | Radu Curticapean |