| 2025 | Parallel Repetition for Post-Quantum Arguments. | Andrew Huang, Yael Tauman Kalai |
| 2025 | Explicit Lossless Vertex Expanders. | Jun-Ting Hsieh, Alexander Lubotzky, Sidhanth Mohanty, Assaf Reiner, Rachel Yun Zhang |
| 2025 | Near-Optimal Fault-Tolerant Strong Connectivity Preservers. | Gary Hoppenworth, Thatchaphol Saranurak, Benyu Wang |
| 2025 | Asymptotically Optimal Inapproximability of Ek-SAT Reconfiguration. | Shuichi Hirahara, Naoto Ohsaka |
| 2025 | NP-hardness of the Minimum Circuit Size Problem from Well-Studied Assumptions. | Shuichi Hirahara, Rahul Ilango |
| 2025 | Proving Natural Distribution Properties is Harder than Testing Them. | Tal Herman, Guy N. Rothblum |
| 2025 | Query-Efficient Fixpoints of ℓp-Contractions. | Sebastian Haslebacher, Jonas Lill, Patrick Schnider, Simon Weber |
| 2025 | Integer multiplication is at least as hard as matrix transposition. | David Harvey, Joris van der Hoeven |
| 2025 | Parallel (1+ε)-Approximate Multi-Commodity Min-Cost Flow in Almost Optimal Depth and Work. | Bernhard Haeupler, Yonggang Jiang, Yaowei Long, Thatchaphol Saranurak, Shengzhe Wang |
| 2025 | A Little Clairvoyance Is All You Need. | Anupam Gupta, Haim Kaplan, Alexander Lindermayr, Jens Schlter, Sorrachai Yingchareonthawornchai |
| 2025 | Improved 2-Approximate Shortest Paths for close vertex pairs. | Manoj Gupta |
| 2025 | Nearly Tight Regret Bounds for Profit Maximization in Bilateral Trade. | Simone Di Gregorio, Paul Dtting, Federico Fusco, Chris Schwiegelshohn |
| 2025 | Polynomial bounds for the Graph Minor Structure Theorem. | Maximilian Gorsky, Michal T. Seweryn, Sebastian Wiederrecht |
| 2025 | Sign-Rank of k-Hamming Distance is Constant. | Mika Gs, Nathaniel Harms, Valentin Imbach, Dmitry Sokolov |
| 2025 | Near-Asymptotically-Good Quantum Codes with Transversal CCZ Gates and Sublinear-Weight Parity-Checks. | Louis Golowich, Venkatesan Guruswami |
| 2025 | Towards True Work-Efficiency in Parallel Derandomization: MIS, Maximal Matching, and Hitting Set. | Mohsen Ghaffari, Christoph Grunau |
| 2025 | Robust Local Testability of Tensor Products of Constant-Rate Algebraic Geometry Codes. | Sumegha Garg, Akash Kumar Sengupta |
| 2025 | Rank Bounds and PIT for depth-4 circuits with top fan-in 3 and constant bottom fan-in via a non-linear Edelstein-Kelly theorem. | Abhibhav Garg, Rafael Oliveira, Akash Kumar Sengupta |
| 2025 | High-to-Low Dimensional PPA-completeness: Borsuk-Ulam, Tucker, Consensus Halving, and Ham Sandwich. | Ruiquan Gao, Alexandros Hollender, Aviad Rubinstein |
| 2025 | Group Order is in QCMA. | Franois Le Gall, Harumichi Nishimura, Dhara Thakkar |
| 2025 | ℓ2/ℓ2 Sparse Recovery via Weighted Hypergraph Peeling. | Nick Fischer, Vasileios Nakos |
| 2025 | Beyond Regularity: Simple versus Optimal Mechanisms, Revisited. | Yiding Feng, Yaonan Jin |
| 2025 | Multi-Pass Streaming Lower Bounds for Approximating Max-Cut. | Yumou Fei, Dor Minzer, Shuo Wang |
| 2025 | Ramanujan bigraphs and applications. | Shai Evra, Brooke Feigon, Kathrin Maurischat, Ori Parzanchevski |
| 2025 | Constant Rate Codes for Adaptive Broadcasts Do Not Exist. | Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena |