| 2024 | Naively Sorting Evolving Data is Optimal and Robust. | George Giakkoupis, Marcos Kiwi, Dimitrios Los |
| 2024 | Computing the 3-Edge-Connected Components of Directed Graphs in Linear Time. | Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas |
| 2024 | Ramsey Theorems for Trees and a General 'Private Learning Implies Online Learning' Theorem. | Simone Fioravanti, Steve Hanneke, Shay Moran, Hilla Schefler, Iska Tsubari |
| 2024 | Near-Optimal (1+ε)-Approximate Fully-Dynamic All-Pairs Shortest Paths in Planar Graphs. | Arnold Filtser, Gramoz Goranci, Neel Patel, Maximilian Probst Gutenberg |
| 2024 | Sparse Graph Counting and Kelley-Meka Bounds for Binary Systems. | Yuval Filmus, Hamed Hatami, Kaave Hosseini, Esty Kelman |
| 2024 | Optimal Bounds for Open Addressing Without Reordering. | Martn Farach-Colton, Andrew Krapivin, William Kuszmaul |
| 2024 | Verifying Groups in Linear Time. | Shai Evra, Shay Gadot, Ohad Klein, Ilan Komargodski |
| 2024 | Sensitivity, Proximity and FPT Algorithms for Exact Matroid Problems. | Friedrich Eisenbrand, Lars Rohwedder, Karol Wegrzycki |
| 2024 | Efficient and Near-Optimal Noise Generation for Streaming Differential Privacy. | Krishnamurthy Dj Dvijotham, H. Brendan McMahan, Krishna Pillutla, Thomas Steinke, Abhradeep Thakurta |
| 2024 | Online Combinatorial Allocations and Auctions with Few Samples. | Paul Dtting, Thomas Kesselheim, Brendan Lucier, Rebecca Reiffenhuser, Sahil Singla |
| 2024 | First-Order Model Checking on Monadically Stable Graph Classes. | Jan Dreier, Ioannis Eleftheriadis, Nikolas Mhlmann, Rose McCarty, Michal Pilipczuk, Szymon Torunczyk |
| 2024 | How to Simulate Random Oracles with Auxiliary Input. | Yevgeniy Dodis, Aayush Jain, Huijia Lin, Ji Luo, Daniel Wichs |
| 2024 | Expansion of High-Dimensional Cubical Complexes: with Application to Quantum Locally Testable Codes. | Irit Dinur, Ting-Chun Lin, Thomas Vidick |
| 2024 | The ESPRIT Algorithm Under High Noise: Optimal Error Scaling and Noisy Super-Resolution. | Zhiyan Ding, Ethan N. Epperly, Lin Lin, Ruizhe Zhang |
| 2024 | Chernoff Bounds and Reverse Hypercontractivity on HDX. | Yotam Dikstein, Max Hopkins |
| 2024 | Low Acceptance Agreement Tests via Bounded-Degree Symplectic HDXs. | Yotam Dikstein, Irit Dinur, Alexander Lubotzky |
| 2024 | Sum-of-Squares Lower Bounds for Non-Gaussian Component Analysis. | Ilias Diakonikolas, Sushrut Karmalkar, Shuo Pang, Aaron Potechin |
| 2024 | Agnostically Learning Multi-Index Models with Queries. | Ilias Diakonikolas, Daniel M. Kane, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis |
| 2024 | Boosting Uniformity in Quasirandom Groups: Fast and Simple. | Harm Derksen, Chin Ho Lee, Emanuele Viola |
| 2024 | Gaussian Approximation of Convex Sets by Intersections of Halfspaces. | Anindya De, Shivam Nadimpalli, Rocco A. Servedio |
| 2024 | Approximation Algorithms for Noncommutative CSPs. | Eric Culf, Hamoon Mousavi, Taro Spirig |
| 2024 | Computational Dynamical Systems. | Jordan Cotler, Semon Rezchikov |
| 2024 | Tight Bounds for the Zig-Zag Product. | Gil Cohen, Itay Cohen, Gal Maor |
| 2024 | Computing Approximate Centerpoints in Polynomial Time. | Yeshwanth Cherapanamjeri |
| 2024 | An Improved Pseudopolynomial Time Algorithm for Subset Sum. | Lin Chen, Jiayi Lian, Yuchen Mao, Guochuan Zhang |