| 2026 | Improved Lower Bounds for QAC0. | Malvika Raj Joshi, Avishay Tal, Francisca Vasconcelos, John Wright |
| 2026 | SNARKs from LWE via Non-black-Box Reductions. | Zhengzhong Jin, Mingqi Lu, Bo Peng |
| 2026 | Memory Reallocation with Polylogarithmic Overhead. | Ce Jin |
| 2026 | Probabilistic Guarantees to Explicit Constructions: Local Properties of Linear Codes. | Fernando Granha Jeronimo, Nikhil Shagrithaya |
| 2026 | Near-Optimal Directed Euclidean Spanners in High Dimensions. | Rajesh Jayaram, Shyamal Patel, Clifford Stein, Erik Waingarten, Tian Zhang |
| 2026 | Efficient Quantum Hermite Transform. | Siddhartha Jain, Vishnu Iyer, Rolando D. Somma, Ning Bao, Stephen P. Jordan |
| 2026 | Failure of Symmetry of Information for Randomized Computations. | Jinqiao Hu, Yahel Manor, Igor C. Oliveira |
| 2026 | Rigorous Implications of the Low-Degree Heuristic. | Jun-Ting Hsieh, Daniel M. Kane, Pravesh K. Kothari, Jerry Li, Sidhanth Mohanty, Stefan Tiegel |
| 2026 | SNARGs for NP from Unprovability of Mathematical Theorems (Or: How to Use the Simplicity of Cryptographic Reasoning). | Yao-Ching Hsieh, Abhishek Jain, Jiatu Li, Surya Mathialagan |
| 2026 | Optimal Random Self-Reductions for All Linear Problems. | Shuichi Hirahara, Nobutaka Shimizu |
| 2026 | Complexity-Theoretic Universal Inductive Inference. | Shuichi Hirahara, Mikito Nanashima |
| 2026 | A Sharp Characterization of Pessiland. | Shuichi Hirahara, Mikito Nanashima |
| 2026 | Clifford Testing: Algorithms and Lower Bounds. | Marcel Hinsche, Zongbo Bao, Philippe van Dordrecht, Jens Eisert, Jop Brit, Jonas Helsen |
| 2026 | Planar Length-Constrained Minimum Spanning Trees. | D. Ellis Hershkowitz, Richard Z. Huang |
| 2026 | An Improved Quality Hierarchical Congestion Approximator in Near-Linear Time. | Monika Henzinger, Robin Mnk, Harald Rcke |
| 2026 | Deterministic Hardness of Approximation of Unique-SVP and GapSVP in ℓ | Yahli Hecht, Muli Safra |
| 2026 | On the Need for (Quantum) Memory with Short Outputs. | Zihan Hao, Zikuan Huang, Qipeng Liu |
| 2026 | On the Learning Curves of Revenue Maximization. | Steve Hanneke, Alkis Kalavasis, Shay Moran, Grigoris Velegkas |
| 2026 | SVP | Isaac M. Hair, Amit Sahai |
| 2026 | A Constant-Approximation Distance Labeling Scheme under Polynomially Many Edge Failures. | Bernhard Haeupler, Yaowei Long, Antti Roeyskoe, Thatchaphol Saranurak |
| 2026 | DAG Projections: Reducing Distance and Flow Problems to DAGs. | Bernhard Haeupler, Yonggang Jiang, Thatchaphol Saranurak |
| 2026 | Deterministic Negative-Weight Shortest Paths in Nearly Linear Time via Path Covers. | Bernhard Haeupler, Yonggang Jiang, Thatchaphol Saranurak |
| 2026 | 3-Query RLDCs Are Strictly Stronger Than 3-Query LDCs. | Tom Gur, Dor Minzer, Guy Weissenberg, Kai Zhe Zheng |
| 2026 | Steiner Forest: A Simplified Better-Than-2 Approximation. | Anupam Gupta, Vera Traub |
| 2026 | Few Single-Qubit Measurements Suffice to Certify Any Quantum State. | Meghal Gupta, William He, Ryan O'Donnell |