| 2025 | Linear Hashing Is Optimal. | Michael Jaber, Vinayak M. Kumar, David Zuckerman |
| 2025 | Fast, Robust Approximate Message Passing. | Misha Ivkov, Tselil Schramm |
| 2025 | Protecting Computations against Continuous Bounded-Communication Leakage. | Yuval Ishai, Yifan Song |
| 2025 | Omnipredicting Single-Index Models with Multi-index Models. | Lunjia Hu, Kevin Tian, Chutong Yang |
| 2025 | Optimal Static Dictionary with Worst-Case Constant Query Time. | Yang Hu, Jingxun Liang, Huacheng Yu, Junkai Zhang, Renfei Zhou |
| 2025 | Simple and Optimal Algorithms for Heavy Hitters and Frequency Moments in Distributed Models. | Zengfeng Huang, Zhongzheng Xiong, Xiaoyi Zhu, Zhewei Wei |
| 2025 | Weak Poincar Inequalities, Simulated Annealing, and Sampling from Spherical Spin Glasses. | Brice Huang, Sidhanth Mohanty, Amit Rajaraman, David X. Wu |
| 2025 | Near-Optimal Dimension Reduction for Facility Location. | Lingxiao Huang, Shaofeng H.-C. Jiang, Robert Krauthgamer, Di Yue |
| 2025 | Explicit Two-Sided Vertex Expanders beyond the Spectral Barrier. | Jun-Ting Hsieh, Ting-Chun Lin, Sidhanth Mohanty, Ryan O'Donnell, Rachel Yun Zhang |
| 2025 | Hypercontractivity on HDX II: Symmetrization and q-Norms. | Max Hopkins |
| 2025 | Fully Dynamic Biconnectivity in (log² n) Time. | Jacob Holm, Wojciech Nadara, Eva Rotenberg, Marek Sokolowski |
| 2025 | Error-Correction of Matrix Multiplication Algorithms. | Shuichi Hirahara, Nobutaka Shimizu |
| 2025 | Single-Copy Stabilizer Testing. | Marcel Hinsche, Jonas Helsen |
| 2025 | Almost Optimal Time Lower Bound for Approximating Parameterized Clique, CSP, and More, under ETH. | Venkatesan Guruswami, Bingkai Lin, Xuandi Ren, Yican Sun, Kewen Wu |
| 2025 | A Zero-Knowledge PCP Theorem. | Tom Gur, Jack O'Connor, Nicholas Spooner |
| 2025 | Quantum One-Time Programs, Revisited. | Aparna Gupte, Jiahui Liu, Justin Raizes, Bhaskar Roberts, Vinod Vaikuntanathan |
| 2025 | Classical Commitments to Quantum States. | Sam Gunn, Yael Tauman Kalai, Anand Natarajan, gi Villnyi |
| 2025 | Student-Teacher Constructive Separations and (Un)Provability in Bounded Arithmetic: Witnessing the Gap. | Stefan Grosser, Marco Carmosino |
| 2025 | On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials V: Over Commutative Rings. | Joshua A. Grochow, Youming Qiao, Katherine E. Stange, Xiaorui Sun |
| 2025 | On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials IV: Linear-Length Reductions and Their Applications. | Joshua A. Grochow, Youming Qiao |
| 2025 | Lifting Linear Sketches: Optimal Bounds and Adversarial Robustness. | Elena Gribelyuk, Honghao Lin, David P. Woodruff, Huacheng Yu, Samson Zhou |
| 2025 | Approximation Guarantees of Median Mechanism in ℝᵈ. | Nikolai Gravin, Jianhao Jia |
| 2025 | Bounded Edit Distance: Optimal Static and Dynamic Algorithms for Small Integer Weights. | Egor Gorbachev, Tomasz Kociumaka |
| 2025 | Supercritical Tradeoffs for Monotone Circuits. | Mika Gs, Gilbert Maystre, Kilian Risse, Dmitry Sokolov |
| 2025 | Quantum Communication Advantage in TFNP. | Mika Gs, Tom Gur, Siddhartha Jain, Jiawei Li |