| 2022 | Negative-Weight Single-Source Shortest Paths in Near-linear Time. | Aaron Bernstein, Danupon Nanongkai, Christian Wulff-Nilsen |
| 2022 | Online List Labeling: Breaking the log | Michael A. Bender, Alex Conway, Martin Farach-Colton, Hanna Komls, William Kuszmaul, Nicole Wein |
| 2022 | Randomised Composition and Small-Bias Minimax. | Shalev Ben-David, Eric Blais, Mika Gs, Gilbert Maystre |
| 2022 | Almost 3-Approximate Correlation Clustering in Constant Rounds. | Soheil Behnezhad, Moses Charikar, Weiyun Ma, Li-Yang Tan |
| 2022 | Geometry of Secure Two-party Computation. | Saugata Basu, Hamidreza Amini Khorasgani, Hemanta K. Maji, Hai H. Nguyen |
| 2022 | Performance and limitations of the QAOA at constant levels on large sparse hypergraphs and spin glass models. | Joao Basso, David Gamarnik, Song Mei, Leo Zhou |
| 2022 | Polynomial-Time Power-Sum Decomposition of Polynomials. | Mitali Bafna, Jun-Ting Hsieh, Pravesh K. Kothari, Jeff Xu |
| 2022 | Rounds vs Communication Tradeoffs for Maximal Independent Sets. | Sepehr Assadi, Gillat Kol, Zhijun Zhang |
| 2022 | Cut Query Algorithms with Star Contraction. | Simon Apers, Yuval Efron, Pawel Gawrychowski, Troy Lee, Sagnik Mukhopadhyay, Danupon Nanongkai |
| 2022 | On Matrix Multiplication and Polynomial Identity Testing. | Robert Andrews |
| 2022 | Estimating the Longest Increasing Subsequence in Nearly Optimal Time. | Alexandr Andoni, Negev Shekel Nosatzki, Sandip Sinha, Clifford Stein |
| 2022 | Solving the Hamilton cycle problem fast on average. | Michael Anastos |
| 2022 | Optimal Sublinear Sampling of Spanning Trees and Determinantal Point Processes via Average-Case Entropic Independence. | Nima Anari, Yang P. Liu, Thuy-Duong Vuong |
| 2022 | Interior point methods are not worse than Simplex. | Xavier Allamigeon, Daniel Dadush, Georg Loho, Bento Natura, Lszl A. Vgh |
| 2022 | Sampling from the Sherrington-Kirkpatrick Gibbs measure via algorithmic stochastic localization. | Ahmed El Alaoui, Andrea Montanari, Mark Sellke |
| 2022 | Breaking the Cubic Barrier for All-Pairs Max-Flow: Gomory-Hu Tree in Nearly Quadratic Time. | Amir Abboud, Robert Krauthgamer, Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak, Ohad Trabelsi |
| 2022 | Indistinguishability Obfuscation via Mathematical Proofs of Equivalence. | Abhishek Jain, Zhengzhong Jin |
| 2022 | Unstructured Hardness to Average-Case Randomness. | Lijie Chen, Ron D. Rothblum, Roei Tell |
| 2022 | Balanced Allocations: The Heavily Loaded Case with Deletions. | Nikhil Bansal, William Kuszmaul |
| 2022 | (n+poly(k))-time Algorithm for Bounded Tree Edit Distance. | Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha, Hamed Saleh |
| 2022 | Local Computation of Maximal Independent Set. | Mohsen Ghaffari |
| 2021 | Tight Bounds for Adversarially Robust Streams and Sliding Windows via Difference Estimators. | David P. Woodruff, Samson Zhou |
| 2021 | The supersingular isogeny path and endomorphism ring problems are equivalent. | Benjamin Wesolowski |
| 2021 | FOCS 2021 Preface. | Nisheeth K. Vishnoi |
| 2021 | A Better-Than-2 Approximation for Weighted Tree Augmentation. | Vera Traub, Rico Zenklusen |