| 2023 | Mind the Gap: Achieving a Super-Grover Quantum Speedup by Jumping to the End. | Alexander M. Dalzell, Nicola Pancotti, Earl T. Campbell, Fernando G. S. L. Brando |
| 2023 | A Constant Factor Prophet Inequality for Online Combinatorial Auctions. | Jos Correa, Andrs Cristi |
| 2023 | Random Walks on Rotating Expanders. | Gil Cohen, Gal Maor |
| 2023 | Approximating Iterated Multiplication of Stochastic Matrices in Small Space. | Gil Cohen, Dean Doron, Ori Sberlo, Amnon Ta-Shma |
| 2023 | Optimal Differentially Private Learning of Thresholds and Quasi-Concave Optimization. | Edith Cohen, Xin Lyu, Jelani Nelson, Tams Sarls, Uri Stemmer |
| 2023 | Approximate Graph Colouring and the Hollow Shadow. | Lorenzo Ciardo, Stanislav Zivn |
| 2023 | A New Deterministic Algorithm for Fully Dynamic All-Pairs Shortest Paths. | Julia Chuzhoy, Ruimin Zhang |
| 2023 | The Smoothed Complexity of Policy Iteration for Markov Decision Processes. | Miranda Christ, Mihalis Yannakakis |
| 2023 | The Power of Multi-step Vizing Chains. | Aleksander Bjrn Grodt Christiansen |
| 2023 | Improved Dynamic Colouring of Sparse Graphs. | Aleksander Bjrn Grodt Christiansen, Krzysztof Nowicki, Eva Rotenberg |
| 2023 | What Makes a Good Fisherman? Linear Regression under Self-Selection Bias. | Yeshwanth Cherapanamjeri, Constantinos Daskalakis, Andrew Ilyas, Manolis Zampetakis |
| 2023 | Complexity of Equilibria in First-Price Auctions under General Tie-Breaking Rules. | Xi Chen, Binghui Peng |
| 2023 | Streaming Euclidean Max-Cut: Dimension vs Data Reduction. | Xiaoyu Chen, Shaofeng H.-C. Jiang, Robert Krauthgamer |
| 2023 | Range Avoidance, Remote Point, and Hard Partial Truth Table via Satisfying-Pairs Algorithms. | Yeyuan Chen, Yizhi Huang, Jiatu Li, Hanlin Ren |
| 2023 | Streaming Euclidean MST to a Constant Factor. | Xi Chen, Vincent Cohen-Addad, Rajesh Jayaram, Amit Levi, Erik Waingarten |
| 2023 | Learning Polynomial Transformations via Generalized Tensor Decompositions. | Sitan Chen, Jerry Li, Yuanzhi Li, Anru R. Zhang |
| 2023 | Randomized versus Deterministic Decision Tree Size. | Arkadev Chattopadhyay, Yogesh Dahiya, Nikhil S. Mande, Jaikumar Radhakrishnan, Swagato Sanyal |
| 2023 | A Characterization of List Learnability. | Moses Charikar, Chirag Pabbaraju |
| 2023 | Fredman's Trick Meets Dominance Product: Fine-Grained Complexity of Unweighted APSP, 3SUM Counting, and More. | Timothy M. Chan, Virginia Vassilevska Williams, Yinzhan Xu |
| 2023 | Computing Better Approximate Pure Nash Equilibria in Cut Games via Semidefinite Programming. | Ioannis Caragiannis, Zhile Jiang |
| 2023 | On the Optimal Fixed-Price Mechanism in Bilateral Trade. | Yang Cai, Jinzhao Wu |
| 2023 | The Complexity of Counting Planar Graph Homomorphisms of Domain Size 3. | Jin-Yi Cai, Ashwin Maran |
| 2023 | Stability Is Stable: Connections between Replicability, Privacy, and Adaptive Generalization. | Mark Bun, Marco Gaboardi, Max Hopkins, Russell Impagliazzo, Rex Lei, Toniann Pitassi, Satchit Sivakumar, Jessica Sorrell |
| 2023 | Algorithms Approaching the Threshold for Semi-random Planted Clique. | Rares-Darius Buhai, Pravesh K. Kothari, David Steurer |
| 2023 | Towards the Erdős-Gallai Cycle Decomposition Conjecture. | Matija Bucic, Richard Montgomery |