| 2026 | Quantum Precomputation: Parallelizing Cascade Circuits and the Moore-Nilsson Conjecture Is False. | Adam Bene Watts, Charles R. Chen, J. William Helton, Joseph Slote |
| 2026 | Derandomizing Matrix Concentration Inequalities from Free Probability. | Robert Wang, Lap Chi Lau, Hong Zhou |
| 2026 | On the Cryptographic Foundations of Interactive Quantum Advantage. | Kabir Tomer, Mark Zhandry |
| 2026 | Fisher Meets Lindahl: A Unified Duality Framework for Market Equilibrium. | Yixin Tao, Weiqiang Zheng |
| 2026 | NP-Membership for the Boundary-Boundary Art-Gallery Problem. | Jack Stade |
| 2026 | Hesse's Redemption: Efficient Convex Polynomial Programming. | Lucas Slot, David Steurer, Manuel Wiedmer |
| 2026 | Hardness Amplification beyond Boolean Functions. | Nobutaka Shimizu, Kenji Yasunaga |
| 2026 | Reconstruction of Depth-3 Arithmetic Circuits with Constant Top Fan-In. | Shubhangi Saraf, Devansh Shringi, Narmada Varadarajan |
| 2026 | On the Computational Hardness of Transformers. | Barna Saha, Yinzhan Xu, Christopher Ye, Hantao Yu |
| 2026 | Secretary, Prophet, and Stochastic Probing via Big-Decisions-First. | Aviad Rubinstein, Sahil Singla |
| 2026 | A Poisson Process for Submodular Maximization. | Amit Ganz Rozenman, Ariel Kulik, Roy Schwartz, Mohit Singh |
| 2026 | Beating Meet-in-the-Middle for Subset Balancing Problems. | Tim Randolph, Karol Wegrzycki |
| 2026 | Markov Chains Approximate Message Passing. | Amit Rajaraman, David X. Wu |
| 2026 | From Hop Reduction to Sparsification for Negative Length Shortest Paths. | Kent Quanrud, Navid Tajkhorshid |
| 2026 | Approximating Directed Connectivity in Almost-Linear Time. | Kent Quanrud |
| 2026 | The Debiased Keyl's Algorithm: A New Unbiased Estimator for Full State Tomography. | Angelos Pelecanos, Jack Spilecki, John Wright |
| 2026 | Quantum Circuit Lower Bounds in the Magic Hierarchy. | Natalie Parham |
| 2026 | Nonuniform Graph Partitioning with Just a Little Flex. | Neil Olver, Harald Rcke, Stefan Schmid |
| 2026 | Extractors for Samplable Distributions from the Two-Source Extractor Recipe. | Justin Oh, Ronen Shaltiel |
| 2026 | Instance-Optimal Quantum State Certification with Entangled Measurements. | Ryan O'Donnell, Chirag Wadhwa |
| 2026 | Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization. | Aleksandar Nikolov, Haohua Tang, Jonathan Ullman |
| 2026 | Almost-Optimal Approximation Algorithms for Global Minimum Cut in Directed Graphs. | Ron Mosenzon |
| 2026 | Improved Local Computation Algorithms for Greedy Set Cover via Retroactive Updates. | Slobodan Mitrovic, Srikkanth Ramachandran, Ronitt Rubinfeld, Mihir Singhal |
| 2026 | Near Optimal Hardness of Approximating k-CSP. | Dor Minzer, Kai Zhe Zheng |
| 2026 | Pattern-Sparse Tree Decompositions in H-Minor-Free Graphs. | Dniel Marx, Marcin Pilipczuk, Michal Pilipczuk |