| 2024 | A (3/2 + 1/e)-Approximation Algorithm for Ordered TSP. Susanne Armbruster, Matthias Mnich, Martin Nägele |
| 2024 | A Constant Factor Approximation for Directed Feedback Vertex Set in Graphs of Bounded Genus. Hao Sun |
| 2024 | A Logarithmic Approximation of Linearly-Ordered Colourings. Johan Håstad, Björn Martinsson, Tamio-Vesa Nakajima, Stanislav Zivný |
| 2024 | Additive Noise Mechanisms for Making Randomized Approximation Algorithms Differentially Private. Jakub Tetek |
| 2024 | An EPTAS for Cardinality Constrained Multiple Knapsack via Iterative Randomized Rounding. Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai |
| 2024 | Approximate Degree Composition for Recursive Functions. Sourav Chakraborty, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar, Nitin Saurabh |
| 2024 | Approximating the Number of Relevant Variables in a Parity Implies Proper Learning. Nader H. Bshouty, George Haddad |
| 2024 | Approximation Algorithms for Correlated Knapsack Orienteering. David Alemán Espinosa, Chaitanya Swamy |
| 2024 | Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2024, London School of Economics, London, UK, August 28-30, 2024 Amit Kumar, Noga Ron-Zewi |
| 2024 | Asynchronous Majority Dynamics on Binomial Random Graphs. Divyarthi Mohan, Pawel Pralat |
| 2024 | Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3. Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi |
| 2024 | Capacity-Achieving Gray Codes. Venkatesan Guruswami, Hsin-Po Wang |
| 2024 | Coboundary and Cosystolic Expansion Without Dependence on Dimension or Degree. Yotam Dikstein, Irit Dinur |
| 2024 | Competitive Query Minimization for Stable Matching with One-Sided Uncertainty. Evripidis Bampis, Konstantinos Dogeas, Thomas Erlebach, Nicole Megow, Jens Schlöter, Amitabh Trehan |
| 2024 | Consequences of Randomized Reductions from SAT to Time-Bounded Kolmogorov Complexity. Halley Goldberg, Valentine Kabanets |
| 2024 | Degrees and Network Design: New Problems and Approximations. Michael Dinitz, Guy Kortsarz, Shi Li |
| 2024 | Derandomizing Multivariate Polynomial Factoring for Low Degree Factors. Pranjal Dutta, Amit Sinhababu, Thomas Thierauf |
| 2024 | Distributional Online Weighted Paging with Limited Horizon. Yaron Fairstein, Joseph (Seffi) Naor, Tomer Tsachor |
| 2024 | Expanderizing Higher Order Random Walks. Vedat Levi Alev, Shravas Rao |
| 2024 | Explicit and Near-Optimal Construction of t-Rankwise Independent Permutations. Nicholas Harvey, Arvin Sahami |
| 2024 | Fast and Slow Mixing of the Kawasaki Dynamics on Bounded-Degree Graphs. Aiya Kuchukova, Marcus Pappik, Will Perkins, Corrine Yap |
| 2024 | Faster Algorithms for Schatten-p Low Rank Approximation. Praneeth Kacham, David P. Woodruff |
| 2024 | Front Matter, Table of Contents, Preface, Conference Organization. |
| 2024 | Greedy Heuristics and Linear Relaxations for the Random Hitting Set Problem. Gabriel Arpino, Daniil Dmitriev, Nicolò Grometto |
| 2024 | Hilbert Functions and Low-Degree Randomness Extractors. Alexander Golovnev, Zeyu Guo, Pooya Hatami, Satyajeet Nagargoje, Chao Yan |
| 2024 | Hybrid k-Clustering: Blending k-Median and k-Center. Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi |
| 2024 | Improved Bounds for Graph Distances in Scale Free Percolation and Related Models. Kostas Lakis, Johannes Lengler, Kalina Petrova, Leon Schiller |
| 2024 | Improved Bounds for High-Dimensional Equivalence and Product Testing Using Subcube Queries. Tomer Adar, Eldar Fischer, Amit Levi |
| 2024 | Improved Online Load Balancing with Known Makespan. Martin Böhm, Matej Lieskovský, Sören Schmitt, Jirí Sgall, Rob van Stee |
| 2024 | Improved Streaming Algorithm for the Klee's Measure Problem and Generalizations. Mridul Nandi, N. V. Vinodchandran, Arijit Ghosh, Kuldeep S. Meel, Soumit Pal, Sourav Chakraborty |
| 2024 | Interactive Coding with Unbounded Noise. Eden Fargion, Ran Gelles, Meghal Gupta |
| 2024 | Learning-Augmented Maximum Independent Set. Vladimir Braverman, Prathamesh Dharangutte, Vihan Shah, Chen Wang |
| 2024 | Matrix Multiplication Reductions. Ashish Gola, Igor Shinkar, Harsimran Singh |
| 2024 | Matrix Multiplication Verification Using Coding Theory. Huck Bennett, Karthik Gajulapalli, Alexander Golovnev, Evelyn Warton |
| 2024 | Maximum Unique Coverage on Streams: Improved FPT Approximation Scheme and Tighter Space Lower Bound. Philip Cervenjak, Junhao Gan, Seeun William Umboh, Anthony Wirth |
| 2024 | More Basis Reduction for Linear Codes: Backward Reduction, BKZ, Slide Reduction, and More. Surendra Ghentiyala, Noah Stephens-Davidowitz |
| 2024 | Near-Linear Time Samplers for Matroid Independent Sets with Applications. Xiaoyu Chen, Heng Guo, Xinyuan Zhang, Zongrui Zou |
| 2024 | Nearly Optimal Bounds for Sample-Based Testing and Learning of k-Monotone Functions. Hadley Black |
| 2024 | Nearly Optimal Local Algorithms for Constructing Sparse Spanners of Clusterable Graphs. Reut Levi, Moti Medina, Omer Tubul |
| 2024 | On Black-Box Meta Complexity and Function Inversion. Noam Mazor, Rafael Pass |
| 2024 | On Instance-Optimal Algorithms for a Generalization of Nuts and Bolts and Generalized Sorting. Mayank Goswami, Riko Jacob |
| 2024 | On Sampling from Ising Models with Spectral Constraints. Andreas Galanis, Alkis Kalavasis, Anthimos Vardis Kandiros |
| 2024 | On the Amortized Complexity of Approximate Counting. Ishaq Aden-Ali, Yanjun Han, Jelani Nelson, Huacheng Yu |
| 2024 | On the Communication Complexity of Finding a King in a Tournament. Nikhil S. Mande, Manaswi Paraashar, Swagato Sanyal, Nitin Saurabh |
| 2024 | On the Generalized Mean Densest Subgraph Problem: Complexity and Algorithms. Karthekeyan Chandrasekaran, Chandra Chekuri, Manuel R. Torres, Weihao Zhu |
| 2024 | On the Houdré-Tetali Conjecture About an Isoperimetric Constant of Graphs. Lap Chi Lau, Dante Tjowasi |
| 2024 | On the NP-Hardness Approximation Curve for Max-2Lin(2). Björn Martinsson |
| 2024 | Online Time-Windows TSP with Predictions. Shuchi Chawla, Dimitris Christou |
| 2024 | Online k-Median with Consistent Clusters. Benjamin Moseley, Heather Newman, Kirk Pruhs |
| 2024 | Optimal Pseudorandom Generators for Low-Degree Polynomials over Moderately Large Fields. Ashish Dwivedi, Zeyu Guo, Ben Lee Volk |
| 2024 | Parallel Repetition of k-Player Projection Games. Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer |
| 2024 | Parallelising Glauber Dynamics. Holden Lee |
| 2024 | Private Counting of Distinct Elements in the Turnstile Model and Extensions. Monika Henzinger, A. R. Sricharan, Teresa Anna Steiner |
| 2024 | Public Coin Interactive Proofs for Label-Invariant Distribution Properties. Tal Herman |
| 2024 | Ramsey Properties of Randomly Perturbed Hypergraphs. Elad Aigner-Horev, Dan Hefetz, Mathias Schacht |
| 2024 | Randomness Extractors in AC⁰ and NC¹: Optimal up to Constant Factors. Kuan Cheng, Ruiyang Wu |
| 2024 | Rapid Mixing of the Down-Up Walk on Matchings of a Fixed Size. Vishesh Jain, Clayton Mizgerd |
| 2024 | Rectangle Tiling Binary Arrays. Pratik Ghosal, Syed Mohammad Meesum, Katarzyna Paluch |
| 2024 | Refining the Adaptivity Notion in the Huge Object Model. Tomer Adar, Eldar Fischer |
| 2024 | Scheduling Splittable Jobs on Configurable Machines. Matthew Casey, Rajmohan Rajaraman, David Stalfa, Cheng Tan |
| 2024 | Scheduling on a Stochastic Number of Machines. Moritz Buchem, Franziska Eberle, Hugo Kooki Kasuya Rosado, Kevin Schewior, Andreas Wiese |
| 2024 | Sparse High Dimensional Expanders via Local Lifts. Inbar Ben Yaacov, Yotam Dikstein, Gal Maor |
| 2024 | Speed-Robust Scheduling Revisited. Josef Minarík, Jirí Sgall |
| 2024 | Stochastic Distance in Property Testing. Uri Meir, Gregory Schwartzman, Yuichi Yoshida |
| 2024 | Support Testing in the Huge Object Model. Tomer Adar, Eldar Fischer, Amit Levi |
| 2024 | Testing Intersectingness of Uniform Families. Ishay Haviv, Michal Parnas |
| 2024 | The Average-Value Allocation Problem. Kshipra Bhawalkar, Zhe Feng, Anupam Gupta, Aranyak Mehta, David Wajc, Di Wang |
| 2024 | The Expander Hitting Property When the Sets Are Arbitrarily Unbalanced. Amnon Ta-Shma, Ron Zadicario |
| 2024 | The Number of Random 2-SAT Solutions Is Asymptotically Log-Normal. Arnab Chatterjee, Amin Coja-Oghlan, Noëla Müller, Connor Riddlesden, Maurice Rolvien, Pavel Zakharov, Haodong Zhu |
| 2024 | The Telephone k-Multicast Problem. Daniel Hathcock, Guy Kortsarz, R. Ravi |
| 2024 | Towards Simpler Sorting Networks and Monotone Circuits for Majority. Natalia Dobrokhotova-Maikova, Alexander Kozachinskiy, Vladimir V. Podolskii |
| 2024 | Trace Reconstruction from Local Statistical Queries. Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio |
| 2024 | Universal Optimization for Non-Clairvoyant Subadditive Joint Replenishment. Tomer Ezra, Stefano Leonardi, Michal Pawlowski, Matteo Russo, Seeun William Umboh |
| 2024 | Upper Bounds on the 2-Colorability Threshold of Random d-Regular k-Uniform Hypergraphs for k ≥ 3. Evan Chang, Neel Kolhe, Youngtak Sohn |
| 2024 | Weighted Matching in the Random-Order Streaming and Robust Communication Models. Diba Hashemi, Weronika Wrzos-Kaminska |
| 2024 | When Can an Expander Code Correct Ω(n) Errors in O(n) Time? Kuan Cheng, Minghui Ouyang, Chong Shangguan, Yuanting Shen |
| 2024 | When Do Low-Rate Concatenated Codes Approach The Gilbert-Varshamov Bound? Dean Doron, Jonathan Mosheiff, Mary Wootters |