| 2023 | Strong Spatial Mixing for Colorings on Trees and its Algorithmic Applications. | Zongchen Chen, Kuikui Liu, Nitya Mani, Ankur Moitra |
| 2023 | When Does Adaptivity Help for Quantum State Learning? | Sitan Chen, Brice Huang, Jerry Li, Allen Liu, Mark Sellke |
| 2023 | Uniqueness and Rapid Mixing in the Bipartite Hardcore Model (extended abstract). | Xiaoyu Chen, Jingcheng Liu, Yitong Yin |
| 2023 | Triplet Reconstruction and all other Phylogenetic CSPs are Approximation Resistant. | Vaggos Chatziafratis, Konstantin Makarychev |
| 2023 | Covering Planar Metrics (and Beyond): O(1) Trees Suffice. | Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than |
| 2023 | Faster Algorithms for Text-to-Pattern Hamming Distances. | Timothy M. Chan, Ce Jin, Virginia Vassilevska Williams, Yinzhan Xu |
| 2023 | Optimal Algorithms for Bounded Weighted Edit Distance. | Alejandro Cassis, Tomasz Kociumaka, Philip Wellnitz |
| 2023 | ReSQueing Parallel and Private Stochastic Convex Optimization. | Yair Carmon, Arun Jambulapati, Yujia Jin, Yin Tat Lee, Daogao Liu, Aaron Sidford, Kevin Tian |
| 2023 | Canonical decompositions of 3-connected graphs. | Johannes Carmesin, Jan Kurkofka |
| 2023 | The Full Landscape of Robust Mean Testing: Sharp Separations between Oblivious and Adaptive Contamination. | Clment L. Canonne, Samuel B. Hopkins, Jerry Li, Allen Liu, Shyam Narayanan |
| 2023 | One Tree to Rule Them All: Poly-Logarithmic Universal Steiner Tree. | Costas Busch, Da Qi Chen, Arnold Filtser, Daniel Hathcock, D. Ellis Hershkowitz, Rajmohan Rajaraman |
| 2023 | Constant-Factor Approximation Algorithms for Convex Cover and Hidden Set in a Simple Polygon. | Reilly Browne, Prahlad Narasimhan Kasthurirangan, Joseph S. B. Mitchell, Valentin Polishchuk |
| 2023 | Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster! | Karl Bringmann, Alejandro Cassis, Nick Fischer |
| 2023 | Algorithmic Decorrelation and Planted Clique in Dependent Random Graphs: The Case of Extra Triangles. | Guy Bresler, Chenghao Guo, Yury Polyanskiy |
| 2023 | Parallel Repetition for the GHZ Game: Exponential Decay. | Mark Braverman, Subhash Khot, Dor Minzer |
| 2023 | Faster High Accuracy Multi-Commodity Flow from Single-Commodity Techniques. | Jan van den Brand, Daniel J. Zhang |
| 2023 | Deterministic Fully Dynamic SSSP and More. | Jan van den Brand, Adam Karczmarz |
| 2023 | A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow. | Jan van den Brand, Li Chen, Richard Peng, Rasmus Kyng, Yang P. Liu, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford |
| 2023 | Separating MAX 2-AND, MAX DI-CUT and MAX CUT. | Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick |
| 2023 | The Vector Balancing Constant for Zonotopes. | Rainie Bozzai, Victor Reis, Thomas Rothvoss |
| 2023 | Bridge Girth: A Unifying Notion in Network Design. | Greg Bodwin, Gary Hoppenworth, Ohad Trabelsi |
| 2023 | Folklore Sampling is Optimal for Exact Hopsets: Confirming the √n Barrier. | Greg Bodwin, Gary Hoppenworth |
| 2023 | A strong composition theorem for junta complexity and the boosting of property testers. | Guy Blanc, Caleb Koch, Carmen Strassle, Li-Yang Tan |
| 2023 | Sampling from the Potts model at low temperatures via Swendsen-Wang dynamics. | Antonio Blanca, Reza Gheissari |
| 2023 | Testing Graph Properties with the Container Method. | Eric Blais, Cameron Seth |