| 2024 | Simple Constructions of Linear-Depth t-Designs and Pseudorandom Unitaries. | Tony Metger, Alexander Poremba, Makrand Sinha, Henry Yuen |
| 2024 | Succinct Arguments for QMA from Standard Assumptions via Compiled Nonlocal Games. | Tony Metger, Anand Natarajan, Tina Zhang |
| 2024 | On the Complexity of Avoiding Heavy Elements. | Zhenjian Lu, Igor C. Oliveira, Hanlin Ren, Rahul Santhanam |
| 2024 | Quantum Eigenvalue Processing. | Guang Hao Low, Yuan Su |
| 2024 | Fast Mixing in Sparse Random Ising Models. | Kuikui Liu, Sidhanth Mohanty, Amit Rajaraman, David X. Wu |
| 2024 | Locally Stationary Distributions: A Framework for Analyzing Slow-Mixing Markov Chains. | Kuikui Liu, Sidhanth Mohanty, Prasad Raghavendra, Amit Rajaraman, David X. Wu |
| 2024 | On Approximate Fully-Dynamic Matching and Online Matrix-Vector Multiplication. | Yang P. Liu |
| 2024 | Distinguishing, Predicting, and Certifying: On the Long Reach of Partial Notions of Pseudorandomness. | Jiatu Li, Edward Pyne, Roei Tell |
| 2024 | Efficient Statistics With Unknown Truncation, Polynomial Time Algorithms, Beyond Gaussians. | Jane H. Lee, Anay Mehrotra, Manolis Zampetakis |
| 2024 | Computational Hardness of Detecting Graph Lifts and Certifying Lift-Monotone Properties of Random Regular Graphs. | Dmitriy Kunisky, Xifan Yu |
| 2024 | Tensor Cumulants for Statistical Inference on Invariant Distributions. | Dmitriy Kunisky, Cristopher Moore, Alexander S. Wein |
| 2024 | Exponential Lower Bounds for Smooth 3-LCCs and Sharp Bounds for Designs. | Pravesh K. Kothari, Peter Manohar |
| 2024 | Strong vs. Weak Range Avoidance and the Linear Ordering Principle. | Oliver Korten, Toniann Pitassi |
| 2024 | Minor Containment and Disjoint Paths in Almost-Linear Time. | Tuukka Korhonen, Michal Pilipczuk, Giannos Stamoulis |
| 2024 | Efficient Approximation of Fractional Hypertree Width. | Viktoriia Korchemna, Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan, Jie Xue |
| 2024 | Power Series Composition in Near-Linear Time. | Yasunori Kinoshita, Baitian Li |
| 2024 | Gapped Clique Homology on Weighted Graphs is QMA1-Hard and Contained in QMA. | Robbie King, Tamara Kohler |
| 2024 | Near-Optimal Size Linear Sketches for Hypergraph Cut Sparsifiers. | Sanjeev Khanna, Aaron Putterman, Madhu Sudan |
| 2024 | Jump Operators, Interactive Proofs and Proof Complexity Generators. | Erfan Khaniki |
| 2024 | Lempel-Ziv (LZ77) Factorization in Sublinear Time. | Dominik Kempa, Tomasz Kociumaka |
| 2024 | A Dense Model Theorem for the Boolean Slice. | Gil Kalai, Noam Lifshitz, Dor Minzer, Tamar Ziegler |
| 2024 | Benchmark-Tight Approximation Ratio of Simple Mechanism for a Unit-Demand Buyer. | Yaonan Jin, Pinyan Lu |
| 2024 | Sampling, Counting, and Large Deviations for Triangle-Free Graphs Near the Critical Density. | Matthew Jenssen, Will Perkins, Aditya Potukuchi, Michael Simkin |
| 2024 | An XOR Lemma for Deterministic Communication Complexity. | Siddharth Iyer, Anup Rao |
| 2024 | Faster Isomorphism Testing of p-Groups of Frattini Class 2. | Gbor Ivanyos, Euan J. Mendoza, Youming Qiao, Xiaorui Sun, Chuanqi Zhang |