| 2023 | Online Ordinal Problems: Optimality of Comparison-based Algorithms and their Cardinal Complexity. | Nick Gravin, Enze Sun, Zhihao Gavin Tang |
| 2023 | Sparse Submodular Function Minimization. | Andrei Graur, Haotian Jiang, Aaron Sidford |
| 2023 | Top-Down Lower Bounds for Depth-Four Circuits. | Mika Gs, Artur Riazanov, Anastasia Sofronova, Dmitry Sokolov |
| 2023 | From Grassmannian to Simplicial High-Dimensional Expanders. | Louis Golowich |
| 2023 | Fourier Growth of Communication Protocols for XOR Functions. | Uma Girish, Makrand Sinha, Avishay Tal, Kewen Wu |
| 2023 | Fast Numerical Multivariate Multipoint Evaluation. | Sumanta Ghosh, Prahladh Harsha, Simao Herdade, Mrinal Kumar, Ramprasad Saptharishi |
| 2023 | On Lifting Integrality Gaps to SSEH Hardness for Globally Constrained CSPs. | Suprovat Ghoshal, Euiwoong Lee |
| 2023 | Towards Separating Computational and Statistical Differential Privacy. | Badih Ghazi, Rahul Ilango, Pritish Kamath, Ravi Kumar, Pasin Manurangsi |
| 2023 | The Bit Complexity of Efficient Continuous Optimization. | Mehrdad Ghadiri, Richard Peng, Santosh S. Vempala |
| 2023 | On Symmetric Factorizations of Hankel Matrices. | Mehrdad Ghadiri |
| 2023 | A deterministic near-linear time approximation scheme for geometric transportation. | Emily Fox, Jiashuai Lu |
| 2023 | Path-Reporting Distance Oracles with Logarithmic Stretch and Size O(n log log n). | Michael Elkin, Idan Shabat |
| 2023 | Constant Approximation for Private Interdependent Valuations. | Alon Eden, Michal Feldman, Kira Goldner, Simon Mauras, Divyarthi Mohan |
| 2023 | Proof of the Clustered Hadwiger Conjecture. | Vida Dujmovic, Louis Esperet, Pat Morin, David R. Wood |
| 2023 | Faster Matrix Multiplication via Asymmetric Hashing. | Ran Duan, Hongxun Wu, Renfei Zhou |
| 2023 | A Randomized Algorithm for Single-Source Shortest Path on Undirected Real-Weighted Graphs. | Ran Duan, Jiayi Mao, Xinkai Shu, Longhui Yin |
| 2023 | Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz. | Jonas Conneryd, Susanna F. de Rezende, Jakob Nordstrm, Shuo Pang, Kilian Risse |
| 2023 | Streaming Euclidean k-median and k-means with o(log n) Space. | Vincent Cohen-Addad, David P. Woodruff, Samson Zhou |
| 2023 | Deterministic Clustering in High Dimensional Spaces: Sketches and Approximation. | Vincent Cohen-Addad, David Saulpic, Chris Schwiegelshohn |
| 2023 | Planar and Minor-Free Metrics Embed into Metrics of Polylogarithmic Treewidth with Expected Multiplicative Distortion Arbitrarily Close to 1. | Vincent Cohen-Addad, Hung Le, Marcin Pilipczuk, Michal Pilipczuk |
| 2023 | Handling Correlated Rounding Error via Preclustering: A 1.73-approximation for Correlation Clustering. | Vincent Cohen-Addad, Euiwoong Lee, Shi Li, Alantha Newman |
| 2023 | ABE for Circuits with poly (λ) -sized Keys from LWE. | Valerio Cini, Hoeteck Wee |
| 2023 | Query lower bounds for log-concave sampling. | Sinho Chewi, Jaume de Dios Pont, Jerry Li, Chen Lu, Shyam Narayanan |
| 2023 | New Lower Bounds for Adaptive Tolerant Junta Testing. | Xi Chen, Shyamal Patel |
| 2023 | Memory-Query Tradeoffs for Randomized Convex Optimization. | Xi Chen, Binghui Peng |