| 2023 | Balanced Allocations with Heterogeneous Bins: The Power of Memory. | Dimitrios Los, Thomas Sauerwald, John Sylvester |
| 2023 | A Framework for Approximation Schemes on Disk Graphs. | Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi |
| 2023 | Robust Voting Rules from Algorithmic Robust Statistics. | Allen Liu, Ankur Moitra |
| 2023 | A New Approach to Estimating Effective Resistances and Counting Spanning Trees in Expander Graphs. | Lawrence Li, Sushant Sachdeva |
| 2023 | Constant Approximating Parameterized | Bingkai Lin, Xuandi Ren, Yican Sun, Xiuhan Wang |
| 2023 | Efficient decoding up to a constant fraction of the code length for asymptotically good quantum codes. | Anthony Leverrier, Gilles Zmor |
| 2023 | The Power of Clairvoyance for Multi-Level Aggregation and Set Cover with Delay. | Ngoc Mai Le, Seeun William Umboh, Ningyuan Xie |
| 2023 | Pricing Query Complexity of Revenue Maximization. | Renato Paes Leme, Balasubramanian Sivan, Yifeng Teng, Pratik Worah |
| 2023 | Approximate Distance Oracles for Planar Graphs with Subpolynomial Error Dependency. | Hung Le |
| 2023 | Fast Discrepancy Minimization with Hereditary Guarantees. | Kasper Green Larsen |
| 2023 | Exact Flow Sparsification Requires Unbounded Size. | Robert Krauthgamer, Ron Mosenzon |
| 2023 | Mean estimation when you have the source code; or, quantum Monte Carlo methods. | Robin Kothari, Ryan O'Donnell |
| 2023 | Faster and Unified Algorithms for Diameter Reducing Shortcuts and Minimum Chain Covers. | Shimon Kogan, Merav Parter |
| 2023 | Superpolynomial lower bounds for decision tree learning and testing. | Caleb Koch, Carmen Strassle, Li-Yang Tan |
| 2023 | On Minimizing Tardy Processing Time, Max-Min Skewed Convolution, and Triangular Structured ILPs. | Kim-Manuel Klein, Adam Polak, Lars Rohwedder |
| 2023 | Cubic Goldreich-Levin. | Dain Kim, Anqi Li, Jonathan Tidor |
| 2023 | Online and Bandit Algorithms Beyond ℓ | Thomas Kesselheim, Marco Molinaro, Sahil Singla |
| 2023 | Breaking the 𝒪( | Dominik Kempa, Tomasz Kociumaka |
| 2023 | A half-integral Erdős-Psa theorem for directed odd cycles. | Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon, Qiqin Xie |
| 2023 | Toeplitz Low-Rank Approximation with Sublinear Query Complexity. | Michael Kapralov, Hannah Lawrence, Mikhail Makarov, Cameron Musco, Kshiteej Sheth |
| 2023 | Learning Hierarchical Cluster Structure of Graphs in Sublinear Time. | Michael Kapralov, Akash Kumar, Silvio Lattanzi, Aida Mousavifar |
| 2023 | Almost Tight Bounds for Online Facility Location in the Random-Order Model. | Haim Kaplan, David Naori, Danny Raz |
| 2023 | On the Integrality Gap of MFN Relaxation for the Capacitated Facility Location Problem. | Mong-Jen Kao |
| 2023 | Improved girth approximation in weighted undirected graphs. | Avi Kadria, Liam Roditty, Aaron Sidford, Virginia Vassilevska Williams, Uri Zwick |
| 2023 | Quantum Speed-ups for String Synchronizing Sets, Longest Common Substring, and | Ce Jin, Jakob Nogler |