| 2021 | Polynomial time deterministic identity testing algorithm for Σ | Shir Peleg, Amir Shpilka |
| 2021 | Combinatorial Bernoulli factories: matchings, flows, and other polytopes. | Rad Niazadeh, Renato Paes Leme, Jon Schneider |
| 2021 | Dynamic planar point location in optimal time. | Yakov Nekrich |
| 2021 | Improving Schroeppel and Shamir's algorithm for subset sum via orthogonal vectors. | Jesper Nederlof, Karol Wegrzycki |
| 2021 | Support of closed walks and second eigenvalue multiplicity of graphs. | Theo McKenzie, Peter Michael Reichstein Rasmussen, Nikhil Srivastava |
| 2021 | Greedy adversarial equilibrium: an efficient alternative to nonconvex-nonconcave min-max optimization. | Oren Mangoubi, Nisheeth K. Vishnoi |
| 2021 | Pseudodeterministic algorithms and the structure of probabilistic time. | Zhenjian Lu, Igor C. Oliveira, Rahul Santhanam |
| 2021 | Cryptography from sublinear-time average-case hardness of time-bounded Kolmogorov complexity. | Yanyi Liu, Rafael Pass |
| 2021 | Settling the robust learnability of mixtures of Gaussians. | Allen Liu, Ankur Moitra |
| 2021 | Approximate Gomory-Hu tree is faster than | Jason Li, Debmalya Panigrahi |
| 2021 | Vertex connectivity in poly-logarithmic max-flows. | Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai |
| 2021 | Constant approximating k-clique is w[1]-hard. | Bingkai Lin |
| 2021 | Settling SETH vs. approximate sparse directed unweighted diameter (up to (NU)NSETH). | Ray Li |
| 2021 | Deterministic mincut in almost-linear time. | Jason Li |
| 2021 | Climbing algorithms (invited talk). | Leonid A. Levin |
| 2021 | Sampling matrices from Harish-Chandra-Itzykson-Zuber densities with applications to Quantum inference and differential privacy. | Jonathan Leake, Colin S. McSwiggen, Nisheeth K. Vishnoi |
| 2021 | How asymmetry helps buffer management: achieving optimal tail size in cup games. | William Kuszmaul |
| 2021 | Contextual search in the presence of irrational agents. | Akshay Krishnamurthy, Thodoris Lykouris, Chara Podimata, Robert E. Schapire |
| 2021 | Improved dynamic algorithms for longest increasing subsequence. | Tomasz Kociumaka, Saeed Seddighin |
| 2021 | Log-rank and lifting for AND-functions. | Alexander Knop, Shachar Lovett, Sam McGuire, Weiqiang Yuan |
| 2021 | Simplicity creates inequity: implications for fairness, stereotypes, and interpretability (invited paper). | Jon M. Kleinberg, Sendhil Mullainathan |
| 2021 | The ghost in the radiation: robust encodings of the black hole interior (invited paper). | Isaac H. Kim, Eugene Tang, John Preskill |
| 2021 | An improved derandomization of the switching lemma. | Zander Kelley |
| 2021 | Local concentration inequalities and Tomaszewski's conjecture. | Nathan Keller, Ohad Klein |
| 2021 | New cosystolic expanders from tensors imply explicit Quantum LDPC codes with Ω(√ | Tali Kaufman, Ran J. Tessler |