| 2024 | Structural Complexities of Matching Mechanisms. | Yannai A. Gonczarowski, Clayton Thomas |
| 2024 | Exploring and Learning in Sparse Linear MDPs without Computationally Intractable Oracles. | Noah Golowich, Ankur Moitra, Dhruv Rohatgi |
| 2024 | Nonlocality under Computational Assumptions. | Grzegorz Gluch, Khashayar Barooti, Alexandru Gheorghiu, Marc-Olivier Renou |
| 2024 | The Power of Adaptivity in Quantum Query Algorithms. | Uma Girish, Makrand Sinha, Avishay Tal, Kewen Wu |
| 2024 | A Flat Wall Theorem for Matching Minors in Bipartite Graphs. | Archontia C. Giannopoulou, Sebastian Wiederrecht |
| 2024 | Improving the Bit Complexity of Communication for Distributed Convex Optimization. | Mehrdad Ghadiri, Yin Tat Lee, Swati Padmanabhan, William Swartworth, David P. Woodruff, Guanghao Ye |
| 2024 | Optimal Load-Balanced Scalable Distributed Agreement. | Yuval Gelles, Ilan Komargodski |
| 2024 | Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time. | Peter Gartland, Daniel Lokshtanov, Toms Masark, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski |
| 2024 | A Unified Approach to Learning Ising Models: Beyond Independence and Bounded Width. | Jason Gaitonde, Elchanan Mossel |
| 2024 | On the Power of Homogeneous Algebraic Formulas. | Herv Fournier, Nutan Limaye, Srikanth Srinivasan, Sbastien Tavenas |
| 2024 | Black-Box PPP Is Not Turing-Closed. | Noah Fleming, Stefan Grosser, Toniann Pitassi, Robert Robere |
| 2024 | Cosystolic Expansion of Sheaves on Posets with Applications to Good 2-Query Locally Testable Codes and Lifted Codes. | Uriya A. First, Tali Kaufman |
| 2024 | Single-Source Shortest Paths with Negative Real Weights in | Jeremy T. Fineman |
| 2024 | PPAD-Membership for Problems with Exact Rational Solutions: A General Approach via Convex Optimization. | Aris Filos-Ratsikas, Kristoffer Arnsfelt Hansen, Kasper Hgh, Alexandros Hollender |
| 2024 | Strategic Budget Selection in a Competitive Autobidding World. | Yiding Feng, Brendan Lucier, Aleksandrs Slivkins |
| 2024 | Algorithmic Contract Design (Keynote). | Michal Feldman |
| 2024 | The Complexity of Computing KKT Solutions of Quadratic Programs. | John Fearnley, Paul W. Goldberg, Alexandros Hollender, Rahul Savani |
| 2024 | No Complete Problem for Constant-Cost Randomized Communication. | Yuting Fang, Lianna Hambardzumyan, Nathaniel Harms, Pooya Hatami |
| 2024 | Optimal Communication Bounds for Classic Functions in the Coordinator Model and Beyond. | Hossein Esfandiari, Praneeth Kacham, Vahab Mirrokni, David P. Woodruff, Peilin Zhong |
| 2024 | Product Mixing in Compact Lie Groups. | David Ellis, Guy Kindler, Noam Lifshitz, Dor Minzer |
| 2024 | Prophet Inequalities with Cancellation Costs. | Farbod Ekbatani, Rad Niazadeh, Pranav Nuti, Jan Vondrk |
| 2024 | Lower Bounds for Regular Resolution over Parities. | Klim Efremenko, Michal Garlk, Dmitry Itsykson |
| 2024 | Limitations of Stochastic Selection Problems with Pairwise Independent Priors. | Shaddin Dughmi, Yusuf Hakan Kalayci, Neel Patel |
| 2024 | Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes. | Jan Dreier, Nikolas Mhlmann, Szymon Torunczyk |
| 2024 | Opening Up the Distinguisher: A Hardness to Randomness Approach for BPL=L That Uses Properties of BPL. | Dean Doron, Edward Pyne, Roei Tell |