| 2026 | An (n | Sanjeev Khanna, Aaron Putterman, Junkai Song |
| 2026 | How Hard Is It to Verify a Classical Shadow? | Georgios Karaiskos, Dorian Rudolph, Johannes Jakob Meyer, Jens Eisert, Sevag Gharibian |
| 2026 | Hardness, Tractability and Density Thresholds of Finite Pinwheel Scheduling Variants. | Sotiris Kanellopoulos, Giorgos Mitropoulos, Christos Pergaminelis, Thanos Tolias |
| 2026 | Faster Algorithms for (2k-1)-Stretch Distance Oracles. | Avi Kadria, Liam Roditty |
| 2026 | Going Beyond Twin-Width? CSPs with Unbounded Domain and Few Variables. | Peter Jonsson, Victor Lagerkvist, Jorke M. de Vlas, Magnus Wahlstrm |
| 2026 | Deterministic Monotone Min-Plus Product and Convolution. | Ce Jin, Jaewoo Park, Barna Saha, Yinzhan Xu |
| 2026 | The Compressed Oracle Is A Worthy (Multiplicative) Adversary. | Stacey Jeffery, Sebastian Zur |
| 2026 | A Quantum Time-Space Tradeoff for Directed st-Connectivity. | Stacey Jeffery, Galina Pass |
| 2026 | A Tight Double-Exponential Lower Bound for High-Multiplicity Bin Packing. | Klaus Jansen, Felix Ohnesorge, Lis Pirotton |
| 2026 | A Linear Bound for the Size of the Finite Terminal Assembly of a Directed Non-Cooperative Tile Assembly System. | Sergiu Ivanov, Damien Regnault |
| 2026 | Canonical Labelling of Random Regular Graphs. | Mikhail Isaev, Tams Makai, Brendan D. McKay, Pawel Pralat, Jane Tan, Maksim Zhukovskii |
| 2026 | Incremental k-Lowest Planes and Planar k-Nearest Neighbor with Optimal Query Time. | John Iacono, Yakov Nekrich, Martin P. Seybold |
| 2026 | Equivalence Between Coding and Complexity Lower Bounds. | Jinqiao Hu, Zhenjian Lu, Igor C. Oliveira |
| 2026 | On the (Classical and Quantum) Fine-Grained Complexity of Approximate CVP and Max-Cut. | Jeremy Ahrens Huang, Young Kun Ko, Chunhao Wang |
| 2026 | Towards Tight Robust Coresets for k-Medians Clustering. | Lingxiao Huang, Zhenyu Jiang, Yi Li, Xuan Wu |
| 2026 | Local Samplers for Product Distributions. | Jordan Horacsek, Chin Ho Lee, Igor Shinkar, Emanuele Viola, Renfei Zhou |
| 2026 | On (In)approximability of MaxMin Independent Set Reconfiguration. | Hung P. Hoang, Naoto Ohsaka, Rin Saito, Yuma Tamura |
| 2026 | The Dirichlet Mechanism for Rounding with Strong Negative Correlation, with Applications. | David G. Harris, George Z. Li, Nitya Raju, Renata Valieva |
| 2026 | Spiky Rank and Its Applications to Rigidity and Circuits. | Lianna Hambardzumyan, Konstantin Myasnikov, Artur Riazanov, Morgan Shirley, Adi Shraibman |
| 2026 | Better Diameter Bounds for Efficient Shortcuts and a Structural Criterion for Constructiveness. | Bernhard Haeupler, Antti Roeyskoe, Zhijun Zhang |
| 2026 | Set Automata and Limits of Decidability of Two-Variable Logic on Data Words. | Shibashis Guha, Amaldev Manuel, S. P. Rishal |
| 2026 | Algorithms for Finite Group Epimorphism Testing. | Joshua A. Grochow, Pranjal Srivastava, Dhara Thakkar |
| 2026 | On the Pure Quantum Polynomial Hierarchy and Quantified Hamiltonian Complexity. | Sabee Grewal, Dorian Rudolph |
| 2026 | Tight Bounds for Low-Error Frequency Moment Estimation and the Power of Multiple Passes. | Naomi Green-Maimon, Or Zamir |
| 2026 | Mutable Batch Arguments and Applications. | Rishab Goyal |