| 2023 | The Subspace Flatness Conjecture and Faster Integer Programming. | Victor Reis, Thomas Rothvoss |
| 2023 | Certified Hardness vs. Randomness for Log-Space. | Edward Pyne, Ran Raz, Wei Zhan |
| 2023 | Near Optimal Memory-Regret Tradeoff for Online Learning. | Binghui Peng, Aviad Rubinstein |
| 2023 | Secure Computation Meets Distributed Universal Optimality. | Merav Parter |
| 2023 | Convergence of Approximate and Packet Routing Equilibria to Nash Flows Over Time. | Neil Olver, Leon Sering, Laura Vargas Koch |
| 2023 | Explicit orthogonal and unitary designs. | Ryan O'Donnell, Rocco A. Servedio, Pedro Paredes |
| 2023 | Bounding the Quantum Value of Compiled Nonlocal Games: From CHSH to BQP Verification. | Anand Natarajan, Tina Zhang |
| 2023 | Optimal Testing of Generalized Reed-Muller Codes in Fewer Queries. | Dor Minzer, Kai Zhe Zheng |
| 2023 | stateQIP = statePSPACE. | Tony Metger, Henry Yuen |
| 2023 | Traversing combinatorial 0/1-polytopes via optimization. | Arturo Merino, Torsten Mtze |
| 2023 | Toward Better Depth Lower Bounds: A KRW-like theorem for Strong Composition. | Or Meir |
| 2023 | Streaming Lower Bounds and Asymmetric Set-Disjointness. | Shachar Lovett, Jiapeng Zhang |
| 2023 | Improved Hardness of Approximating k-Clique under ETH. | Bingkai Lin, Xuandi Ren, Yican Sun, Xiuhan Wang |
| 2023 | Tight Cell-Probe Lower Bounds for Dynamic Succinct Dictionaries. | Tianxiao Li, Jingxun Liang, Huacheng Yu, Renfei Zhou |
| 2023 | Dynamic "Succincter". | Tianxiao Li, Jingxun Liang, Huacheng Yu, Renfei Zhou |
| 2023 | Two Source Extractors for Asymptotically Optimal Entropy, and (Many) More. | Xin Li |
| 2023 | Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the Ω (log n) Lightness Barrier. | Hung Le, Shay Solomon, Cuong Than |
| 2023 | Super-Logarithmic Lower Bounds for Dynamic Graph Problems. | Kasper Green Larsen, Huacheng Yu |
| 2023 | Agnostic proper learning of monotone functions: beyond the black-box correction barrier. | Jane Lange, Arsen Vasilyan |
| 2023 | Strongly History-Independent Storage Allocation: New Upper and Lower Bounds. | William Kuszmaul |
| 2023 | Lipschitz Continuous Algorithms for Graph Problems. | Soh Kumabe, Yuichi Yoshida |
| 2023 | Improved Approximations for Vector Bin Packing via Iterative Randomized Rounding. | Ariel Kulik, Matthias Mnich, Hadas Shachnai |
| 2023 | Dynamic treewidth. | Tuukka Korhonen, Konrad Majewski, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski |
| 2023 | Approximating Edit Distance in the Fully Dynamic Model. | Tomasz Kociumaka, Anish Mukherjee, Barna Saha |
| 2023 | Properly learning decision trees with queries is NP-hard. | Caleb Koch, Carmen Strassle, Li-Yang Tan |