| 2023 | Optimal Bounds for Noisy Sorting. | Yuzhou Gu, Yinzhan Xu |
| 2023 | Efficient Interactive Coding Achieving Optimal Error Resilience over the Binary Channel. | Meghal Gupta, Rachel Yun Zhang |
| 2023 | Binary Error-Correcting Codes with Minimal Noiseless Feedback. | Meghal Gupta, Venkatesan Guruswami, Rachel Yun Zhang |
| 2023 | An Efficient Decoder for a Linear Distance Quantum LDPC Code. | Shouzhen Gu, Christopher A. Pattison, Eugene Tang |
| 2023 | Extractors for Images of Varieties. | Zeyu Guo, Ben Lee Volk, Akhil Jalan, David Zuckerman |
| 2023 | Commitments to Quantum States. | Sam Gunn, Nathan Ju, Fermi Ma, Mark Zhandry |
| 2023 | Planning and Learning in Partially Observable Systems via Filter Stability. | Noah Golowich, Ankur Moitra, Dhruv Rohatgi |
| 2023 | A New Berry-Esseen Theorem for Expander Walks. | Louis Golowich |
| 2023 | A Moment-Matching Approach to Testable Learning and a New Characterization of Rademacher Complexity. | Aravind Gollakota, Adam R. Klivans, Pravesh K. Kothari |
| 2023 | Hard Languages in NP ∩ coNP and NIZK Proofs from Unstructured Hardness. | Riddhi Ghosal, Yuval Ishai, Alexis Korb, Eyal Kushilevitz, Paul Lou, Amit Sahai |
| 2023 | Approximating Nash Social Welfare by Matching and Local Search. | Jugal Garg, Edin Husic, Wenzheng Li, Lszl A. Vgh, Jan Vondrk |
| 2023 | Pandora Box Problem with Nonobligatory Inspection: Hardness and Approximation Scheme. | Hu Fu, Jiawei Li, Daogao Liu |
| 2023 | Deterministic Incremental APSP with Polylogarithmic Update Time and Stretch. | Sebastian Forster, Yasamin Nazari, Maximilian Probst Gutenberg |
| 2023 | Credible Decentralized Exchange Design via Verifiable Sequencing Rules. | Matheus Venturyne Xavier Ferreira, David C. Parkes |
| 2023 | An Analogue of Bonami's Lemma for Functions on Spaces of Linear Maps, and 2-2 Games. | David Ellis, Guy Kindler, Noam Lifshitz |
| 2023 | An Optimal "It Ain't Over Till It's Over" Theorem. | Ronen Eldan, Avi Wigderson, Pei Wu |
| 2023 | Noise Stability on the Boolean Hypercube via a Renormalized Brownian Motion. | Ronen Eldan, Dan Mikulincer, Prasad Raghavendra |
| 2023 | The Rate of Interactive Codes Is Bounded Away from 1. | Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena |
| 2023 | Multi-agent Contracts. | Paul Dtting, Tomer Ezra, Michal Feldman, Thomas Kesselheim |
| 2023 | First-Order Model Checking on Structurally Sparse Graph Classes. | Jan Dreier, Nikolas Mhlmann, Sebastian Siebertz |
| 2023 | Almost Chor-Goldreich Sources and Adversarial Random Walks. | Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman |
| 2023 | Good Quantum LDPC Codes with Linear Time Decoders. | Irit Dinur, Min-Hsiu Hsieh, Ting-Chun Lin, Thomas Vidick |
| 2023 | New High Dimensional Expanders from Covers. | Yotam Dikstein |
| 2023 | A Strongly Polynomial Algorithm for Approximate Forster Transforms and Its Application to Halfspace Learning. | Ilias Diakonikolas, Christos Tzamos, Daniel M. Kane |
| 2023 | Stochastic Minimum Vertex Cover in General Graphs: A 3/2-Approximation. | Mahsa Derakhshan, Naveen Durvasula, Nika Haghtalab |