| 2026 | Lower Bounds against the Ideal Proof System in Finite Fields. | Tal Elbaz, Nashlen Govindasamy, Jiaqi Lu, Iddo Tzameret |
| 2026 | Strong ETH Holds for Bounded-Depth Resolution over Parities. | Klim Efremenko, Dmitry Itsykson |
| 2026 | Lower Bounds in Algebraic Complexity via Symmetry and Homomorphism Polynomials. | Prateek Dwivedi, Benedikt Pago, Tim Seppelt |
| 2026 | Classifying Identities: Subcubic Distributivity Checking and Hardness from Arithmetic Progression Detection. | Bartlomiej Dudek, Nick Fischer, Geri Gokaj, Ce Jin, Marvin Knnemann, Xiao Mao, Mirza Redzic |
| 2026 | Efficient Reversal of Transductions of Sparse Graph Classes. | Jan Dreier, Jakub Gajarsk, Michal Pilipczuk |
| 2026 | The Skolem Problem in Rings of Positive Characteristic. | Ruiwen Dong, Doron Shafrir |
| 2026 | S-Unit Equations in Modules and Linear-Exponential Diophantine Equations. | Ruiwen Dong, Doron Shafrir |
| 2026 | Compressing Dynamic Fully Indexable Dictionaries in Word-RAM. | Gabriel Marques Domingues |
| 2026 | Locally Computable High Independence Hashing. | Yevgeniy Dodis, Shachar Lovett, Daniel Wichs |
| 2026 | Non-adaptive Cryptanalytic Time-Space Lower Bounds via a Shearer-Like Inequality for Permutations. | Itai Dinur, Nathan Keller, Avichai Marmor |
| 2026 | High Rate Efficient Local List Decoding from HDX. | Yotam Dikstein, Max Hopkins, Toniann Pitassi, Russell Impagliazzo |
| 2026 | Can Like Attract Like? A Study of Homonymous Gathering in Networks. | Stphane Devismes, Yoann Dieudonn, Arnaud Labourel |
| 2026 | SNARGs for NP and Non-signaling PCPs, Revisited. | Lalita Devadas, Samuel B. Hopkins, Yael Tauman Kalai, Pravesh K. Kothari, Alex Lombardi, Surya Mathialagan |
| 2026 | A Unified Framework for Analysis of Randomized Greedy Matching Algorithms. | Mahsa Derakhshan, Tao Yu |
| 2026 | Sparsifying Suprema of Gaussian Processes. | Anindya De, Shivam Nadimpalli, Ryan O'Donnell, Rocco A. Servedio |
| 2026 | Fisher Markets with Approximately Optimal Bundles and the Need for a PCP Theorem for PPAD. | Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos |
| 2026 | Computational and Statistical Lower Bounds for Low-Rank Estimation under General Inhomogeneous Noise. | Debsurya De, Dmitriy Kunisky |
| 2026 | Trust Region Interior Point Methods: Optimal ℓ₂- and Faster Wide-Neighborhood Path Following. | Daniel Dadush, Haoyuan Ma, Bento Natura, Lszl A. Vgh |
| 2026 | On the Informativeness of Moments in Optimal Stopping. | Jos Correa, Andrs Cristi, Vasilis Livanos, Victor Verdugo, Jiechen Zhang |
| 2026 | The Power of Two Bases: Robust and Copy-Optimal Certification of Nearly All Quantum States with Few-Qubit Measurements. | Andrea Coladangelo, Jerry Li, Joseph Slote, Ellen Wu |
| 2026 | Sample Complexity of Agnostic Multiclass Classification: Natarajan Dimension Strikes Back. | Alon Cohen, Liad Erez, Steve Hanneke, Tomer Koren, Yishay Mansour, Shay Moran, Qian Zhang |
| 2026 | A Strong Linear Programming Relaxation for Weighted Tree Augmentation. | Vincent Cohen-Addad, Marina Drygala, Nathan Klein, Ola Svensson |
| 2026 | Combinatorial Optimization using Comparison Oracles. | Vincent Cohen-Addad, Tommaso d'Orsi, Anupam Gupta, Guru Guruganesh, Euiwoong Lee, Renato Paes Leme, Debmalya Panigrahi, Madhusudhan Reddy Pittu, Jon Schneider, David P. Woodruff |
| 2026 | A Faster Deterministic Algorithm for Fully Dynamic Maximal Matching. | Julia Chuzhoy, Sanjeev Khanna, Junkai Song |
| 2026 | Forbidden Subgraphs of Graphs with Low Bandwidth. | Maria Chudnovsky, Daniel Lokshtanov, Eran Nevo |