| 2024 | Optimal Bounds on Private Graph Approximation. | Jingcheng Liu, Jalaj Upadhyay, Zongrui Zou |
| 2024 | Dynamic Dictionary with Subconstant Wasted Bits per Key. | Tianxiao Li, Jingxun Liang, Huacheng Yu, Renfei Zhou |
| 2024 | Recovering the original simplicity: succinct and deterministic quantum algorithm for the welded tree problem. | Guanzhong Li, Lvzhou Li, Jingquan Luo |
| 2024 | VC Set Systems in Minor-free (Di)Graphs and Applications. | Hung Le, Christian Wulff-Nilsen |
| 2024 | Fast Algorithms for Directed Graph Partitioning Using Flows and Reweighted Eigenvalues. | Lap Chi Lau, Kam Chuen Tung, Robert Wang |
| 2024 | Fully Dynamic Consistent | Jakub Lacki, Bernhard Haeupler, Christoph Grunau, Rajesh Jayaram, Vclav Rozhon |
| 2024 | Optimality of Glauber dynamics for general-purpose Ising model sampling and free energy approximation. | Dmitriy Kunisky |
| 2024 | Deterministic Algorithms for Low Degree Factors of Constant Depth Circuits. | Mrinal Kumar, Varun Ramanathan, Ramprasad Saptharishi |
| 2024 | Viderman's algorithm for quantum LDPC codes. | Anirudh Krishna, Inbal Livni Navon, Mary Wootters |
| 2024 | Computing the 5-Edge-Connected Components in Linear Time. | Evangelos Kosinas |
| 2024 | Fully dynamic approximation schemes on planar and apex-minor-free graphs. | Tuukka Korhonen, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski |
| 2024 | Induced-Minor-Free Graphs: Separator Theorem, Subexponential Algorithms, and Improved Hardness of Recognition. | Tuukka Korhonen, Daniel Lokshtanov |
| 2024 | An Unconditional Lower Bound for Two-Pass Streaming Algorithms for Maximum Matching Approximation. | Christian Konrad, Kheeran K. Naidu |
| 2024 | Simple Delegated Choice. | Ali Khodabakhsh, Emmanouil Pountourakis, Samuel Taggart |
| 2024 | Code Sparsification and its Applications. | Sanjeev Khanna, Aaron (Louie) Putterman, Madhu Sudan |
| 2024 | Arborescences, Colorful Forests, and Popularity. | Telikepalli Kavitha, Kazuhisa Makino, Ildik Schlotter, Yu Yokoi |
| 2024 | Exact Shortest Paths with Rational Weights on the Word RAM. | Adam Karczmarz, Wojciech Nadara, Marek Sokolowski |
| 2024 | Max | Adam Karczmarz |
| 2024 | Online Robust Mean Estimation. | Daniel M. Kane, Ilias Diakonikolas, Hanshen Xiao, Sihan Liu |
| 2024 | Cliquewidth and Dimension. | Gwenal Joret, Piotr Micek, Michal Pilipczuk, Bartosz Walczak |
| 2024 | Fully Dynamic Min-Cut of Superconstant Size in Subpolynomial Time. | Wenyu Jin, Xiaorui Sun, Mikkel Thorup |
| 2024 | Convex Minimization with Integer Minima in | Haotian Jiang, Yin Tat Lee, Zhao Song, Lichen Zhang |
| 2024 | The Hierarchy of Hereditary Sorting Operators. | Vt Jelnek, Michal Opler, Jakub Pekrek |
| 2024 | Massively Parallel Algorithms for High-Dimensional Euclidean Minimum Spanning Tree. | Rajesh Jayaram, Vahab Mirrokni, Shyam Narayanan, Peilin Zhong |
| 2024 | Linear-Sized Sparsifiers via Near-Linear Time Discrepancy Theory. | Arun Jambulapati, Victor Reis, Kevin Tian |