| 2023 | A d | Hadley Black, Deeparnab Chakrabarty, C. Seshadhri |
| 2023 | Dynamic (1+ϵ)-Approximate Matching Size in Truly Sublinear Update Time. | Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak |
| 2023 | Chasing Positive Bodies. | Sayan Bhattacharya, Niv Buchbinder, Roie Levin, Thatchaphol Saranurak |
| 2023 | Locally Uniform Hashing. | Ioana O. Bercea, Lorenzo Beretta, Jonas Klausen, Jakob Bk Tejs Houen, Mikkel Thorup |
| 2023 | Local Computation Algorithms for Maximum Matching: New Lower Bounds. | Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein |
| 2023 | Kolmogorov Comes to Cryptomania: On Interactive Kolmogorov Complexity and Key-Agreement. | Marshall Ball, Yanyi Liu, Noam Mazor, Rafael Pass |
| 2023 | Extracting Randomness from Samplable Distributions, Revisited. | Marshall Ball, Eli Goldin, Dana Dachman-Soled, Saachi Mutreja |
| 2023 | Krylov Methods are (nearly) Optimal for Low-Rank Approximation. | Ainesh Bakshi, Shyam Narayanan |
| 2023 | Exponential quantum speedup in simulating coupled classical oscillators | Ryan Babbush, Dominic W. Berry, Robin Kothari, Rolando D. Somma, Nathan Wiebe |
| 2023 | Hidden Permutations to the Rescue: Multi-Pass Streaming Lower Bounds for Approximate Matchings. | Sepehr Assadi, Janani Sundaresan |
| 2023 | IOPs with Inverse Polynomial Soundness Error. | Gal Arnon, Alessandro Chiesa, Eylon Yogev |
| 2023 | Advisor-Verifier-Prover Games and the Hardness of Information Theoretic Cryptography. | Benny Applebaum, Oded Nir |
| 2023 | Sub-quadratic (1+ϵ)-approximate Euclidean Spanners, with Applications. | Alexandr Andoni, Hengjie Zhang |
| 2023 | Faster high-accuracy log-concave sampling via algorithmic warm starts. | Jason M. Altschuler, Sinho Chewi |
| 2023 | Generalizations of Matrix Multiplication can solve the Light Bulb Problem. | Josh Alman, Hengjie Zhang |
| 2023 | Singular Value Approximation and Sparsifying Random Walks on Directed Graphs. | AmirMahdi Ahmadinejad, John Peebles, Edward Pyne, Aaron Sidford, Salil P. Vadhan |
| 2023 | Why we couldn't prove SETH hardness of the Closest Vector Problem for even norms! | Divesh Aggarwal, Rajendra Kumar |
| 2023 | Optimal PAC Bounds without Uniform Convergence. | Ishaq Aden-Ali, Yeshwanth Cherapanamjeri, Abhishek Shetty, Nikita Zhivotovskiy |
| 2023 | The minimal canonical form of a tensor network. | Arturo Acuaviva, Visu Makam, Harold Nieuwboer, David Prez-Garca, Friedrich Sittner, Michael Walter, Freek Witteveen |
| 2023 | All-Pairs Max-Flow is no Harder than Single-Pair Max-Flow: Gomory-Hu Trees in Almost-Linear Time. | Amir Abboud, Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak |
| 2023 | A proof that Reed-Muller codes achieve Shannon capacity on symmetric channels. | Emmanuel Abbe, Colin Sandon |
| 2023 | Parameterized Approximation Schemes for Clustering with General Norm Objectives. | Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dniel Marx, Roohani Sharma, Joachim Spoerhase |
| 2023 | A New Approach to Post-Quantum Non-Malleability. | Xiao Liang, Omkant Pandey, Takashi Yamakawa |
| 2023 | HDX Condensers. | Itay Cohen, Roy Roth, Amnon Ta-Shma |
| 2023 | Tight Time-Space Lower Bounds for Constant-Pass Learning. | Xin Lyu, Avishay Tal, Hongxun Wu, Junzhao Yang |