| 2026 | Polynomial Identity Testing and the Ideal Proof System: PIT Is in NP If and Only If IPS Can Be p-Simulated by a Cook-Reckhow Proof System. | Joshua A. Grochow |
| 2026 | Relaxed vs. Full Local Decodability with Few Queries: Equivalence and Separations for Linear Codes. | Elena Grigorescu, Vinayak M. Kumar, Peter Manohar, Geoffrey Mon |
| 2026 | Adversarial Robustness on Insertion-Deletion Streams. | Elena Gribelyuk, Honghao Lin, David P. Woodruff, Huacheng Yu, Samson Zhou |
| 2026 | Optimal Proximity Gaps for Subspace-Design Codes and (Random) Reed-Solomon Codes. | Rohan Goyal, Venkatesan Guruswami |
| 2026 | Efficient Calibration for Decision Making. | Parikshit Gopalan, Konstantinos Stavropoulos, Kunal Talwar, Pranay Tankala |
| 2026 | Pseudodeterministic Communication Complexity. | Mika Gs, Nathaniel Harms, Artur Riazanov, Anastasia Sofronova, Dmitry Sokolov, Weiqiang Yuan |
| 2026 | Optimal Contest beyond Convexity. | Negin Golrezaei, MohammadTaghi Hajiaghayi, Suho Shin |
| 2026 | Nearly Tight Lower Bounds for Relaxed Locally Decodable Codes via Robust Daisies. | Guy Goldberg, Tom Gur, Sidhant Saraogi |
| 2026 | Magic and Communication Complexity. | Uma Girish, Alex May, Natalie Parham, Henry Yuen |
| 2026 | Fourier Spectrum of Noisy Quantum Algorithms. | Uma Girish |
| 2026 | Range Avoidance, Arthur-Merlin, and TFNP. | Surendra Ghentiyala, Zeyong Li, Noah Stephens-Davidowitz |
| 2026 | Mixing of General Biased Adjacent Transposition Chains. | Reza Gheissari, Holden Lee, Eric Vigoda |
| 2026 | Sub-linear Secure Broadcast and Applications. | Yuval Gelles, Ilan Komargodski, Merav Parter |
| 2026 | Lower Estimates for L₁-Distortion of Transportation Cost Spaces. | Chris Gartland, Mikhail Ostrovskii |
| 2026 | The Weak Rank Principle: Lower Bounds and Applications. | Michal Garlk, Svyatoslav Gryaznov, Hanlin Ren, Iddo Tzameret |
| 2026 | A Unified Approach to Memory-Sample Tradeoffs for Detecting Planted Structures. | Sumegha Garg, Jabari Hastings, Chirag Pabbaraju, Vatsal Sharan |
| 2026 | Online Combinatorial Optimization with Graphical Dependencies. | Zhimeng Gao, Evangelia Gergatsouli, Kalen Patton, Sahil Singla |
| 2026 | Path Cover, Hamiltonicity, and Independence Number: An FPT Perspective. | Fedor V. Fomin, Petr A. Golovach, Nikola Jedlickov, Jan Kratochvl, Danil Sagunov, Kirill Simonov |
| 2026 | Sublogarithmic Distributed Vertex Coloring with Optimal Number of Colors. | Maxime Flin, Magns M. Halldrsson, Manuel Jakob, Yannic Maus |
| 2026 | Universe Reduction for APSP: Equivalence of Three Fine-Grained Hypotheses. | Nick Fischer |
| 2026 | Learning CNF Formulas from Uniform Random Solutions in the Local Lemma Regime. | Weiming Feng, Xiongxin Yang, Yixiao Yu, Yiyao Zhang |
| 2026 | Fast and Compact Random Mappings with Uniform Guarantees and Applications. | Ying Feng, Piotr Indyk |
| 2026 | A Dichotomy Theorem for Multi-pass Streaming CSPs. | Yumou Fei, Dor Minzer, Shuo Wang |
| 2026 | Entrywise Approximate Solutions for SDDM Systems in Almost-Linear Time. | Angelo Farfan, Mehrdad Ghadiri, Junzhao Yang |
| 2026 | Greedy Open Addressing Revisited: Beyond Yao's Lower Bound. | Martn Farach-Colton, Andrew Krapivin, William Kuszmaul |