| 2024 | Three-Edge-Coloring Projective Planar Cubic Graphs: A Generalization of the Four Color Theorem. | Yuta Inoue, Ken-ichi Kawarabayashi, Atsuyuki Miyashita, Bojan Mohar, Tomohiro Sonobe |
| 2024 | Predict to Minimize Swap Regret for All Payoff-Bounded Tasks. | Lunjia Hu, Yifan Wu |
| 2024 | Certifying Almost All Quantum States with Few Single-Qubit Measurements. | Hsin-Yuan Huang, John Preskill, Mehdi Soleimanifar |
| 2024 | Capacity Threshold for the Ising Perceptron. | Brice Huang |
| 2024 | Replicability in High Dimensional Statistics. | Max Hopkins, Russell Impagliazzo, Daniel M. Kane, Sihan Liu, Christopher Ye |
| 2024 | Tight Bounds for Sorting Under Partial Information. | Ivor van der Hoog, Daniel Rutschmann |
| 2024 | Gradient Descent for Unbounded Convex Functions on Hadamard Manifolds and its Applications to Scaling Problems. | Hiroshi Hirai, Keiya Sakabe |
| 2024 | Optimal Coding for Randomized Kolmogorov Complexity and Its Applications. | Shuichi Hirahara, Zhenjian Lu, Mikito Nanashima |
| 2024 | Interactive Proofs for General Distribution Properties. | Tal Herman, Guy N. Rothblum |
| 2024 | Cycles of Well-Linked Sets and an Elementary Bound for the Directed Grid Theorem. | Meike Hatzel, Stephan Kreutzer, Marcelo Garlet Milani, Irene Muzi |
| 2024 | The Online Submodular Assignment Problem. | Daniel Hathcock, Billy Jin, Kalen Patton, Sherry Sarkar, Michael Zlatin |
| 2024 | An Improved Line-Point Low-Degree Test. | Prahladh Harsha, Mrinal Kumar, Ramprasad Saptharishi, Madhu Sudan |
| 2024 | Revisiting Agnostic PAC Learning. | Steve Hanneke, Kasper Green Larsen, Nikita Zhivotovskiy |
| 2024 | Dynamic Deterministic Constant-Approximate Distance Oracles with n | Bernhard Haeupler, Yaowei Long, Thatchaphol Saranurak |
| 2024 | New Structures and Algorithms for Length-Constrained Expander Decompositions. | Bernhard Haeupler, D. Ellis Hershkowitz, Zihan Tan |
| 2024 | Universal Optimality of Dijkstra Via Beyond-Worst-Case Heaps. | Bernhard Haeupler, Richard Hladk, Vclav Rozhon, Robert E. Tarjan, Jakub Tetek |
| 2024 | Efficient Approximate Unitary Designs from Random Pauli Rotations. | Jeongwan Haah, Yunchao Liu, Xinyu Tan |
| 2024 | Certifying Euclidean Sections and Finding Planted Sparse Vectors Beyond the √n Dimension Threshold. | Venkatesan Guruswami, Jun-Ting Hsieh, Prasad Raghavendra |
| 2024 | Optimal Quantile Estimation: Beyond the Comparison Model. | Meghal Gupta, Mihir Singhal, Hongxun Wu |
| 2024 | A Strong Separation for Adversarially Robust ℓ0 Estimation for Linear Sketches. | Elena Gribelyuk, Honghao Lin, David P. Woodruff, Huacheng Yu, Samson Zhou |
| 2024 | On Robustness to k-Wise Independence of Optimal Bayesian Mechanisms. | Nick Gravin, Zhiqi Wang |
| 2024 | Fast List Decoding of Univariate Multiplicity and Folded Reed-Solomon Codes. | Rohan Goyal, Prahladh Harsha, Mrinal Kumar, Ashutosh Shankar |
| 2024 | Improved Condensers for Chor-Goldreich Sources. | Jesse Goodman, Xin Li, David Zuckerman |
| 2024 | Exploration is Harder than Prediction: Cryptographically Separating Reinforcement Learning from Supervised Learning. | Noah Golowich, Ankur Moitra, Dhruv Rohatgi |
| 2024 | Decoding Quasi-Cyclic Quantum LDPC Codes. | Louis Golowich, Venkatesan Guruswami |