| 2021 | Estimating the Nash Social Welfare for coverage and other submodular valuations. | Wenzheng Li, Jan Vondrk |
| 2021 | Optimal Contextual Pricing and Extensions. | Allen Liu, Renato Paes Leme, Jon Schneider |
| 2021 | Asymptotic dimension of minor-closed families and beyond. | Chun-Hung Liu |
| 2021 | Towards PTAS for Precedence Constrained Scheduling via Combinatorial Algorithms. | Shi Li |
| 2021 | Streaming Submodular Matching Meets the Primal-Dual Method. | Roie Levin, David Wajc |
| 2021 | Uncertainty about Uncertainty: Optimal Adaptive Algorithms for Estimating Mixtures of Unknown Coins. | Jasper C. H. Lee, Paul Valiant |
| 2021 | Quantum algorithms for graph problems with cut queries. | Troy Lee, Miklos Santha, Shengyu Zhang |
| 2021 | A Local Search Framework for Experimental Design. | Lap Chi Lau, Hong Zhou |
| 2021 | An | Nathaniel Lahn, Sharath Raghvendra |
| 2021 | A Constant Factor Approximation for Navigating Through Connected Obstacles in the Plane. | Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri |
| 2021 | Optimal Discretization is Fixed-parameter Tractable. | Stefan Kratsch, Toms Masark, Irene Muzi, Marcin Pilipczuk, Manuel Sorge |
| 2021 | Polyhedral Value Iteration for Discounted Games and Energy Games. | Alexander Kozachinskiy |
| 2021 | Unlinking, splitting, and some other NP-hard problems in knot theory. | Dale Koenig, Anastasiia Tsvietkova |
| 2021 | Strong Connectivity Augmentation is FPT. | Kristine Vitting Klinkby, Pranabendu Misra, Saket Saurabh |
| 2021 | Solving hard cut problems via flow-augmentation. | Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlstrm |
| 2021 | How Many Vertices Does a Random Walk Miss in a Network with Moderately Increasing the Number of Vertices? | Shuji Kijima, Nobutaka Shimizu, Takeharu Shiraga |
| 2021 | A Deterministic Parallel APSP Algorithm and its Applications. | Adam Karczmarz, Piotr Sankowski |
| 2021 | Space Lower Bounds for Approximating Maximum Matching in the Edge Arrival Model. | Michael Kapralov |
| 2021 | In which matching markets does the short side enjoy an advantage? | Yash Kanoria, Seungki Min, Pengyu Qian |
| 2021 | Robust Learning of Mixtures of Gaussians. | Daniel M. Kane |
| 2021 | Fast Low-Space Algorithms for Subset Sum. | Ce Jin, Nikhil Vyas, Ryan Williams |
| 2021 | Approximating Permanent of Random Matrices with Vanishing Mean: Made Better and Simpler. | Zhengfeng Ji, Zhihan Jin, Pinyan Lu |
| 2021 | Minimizing Convex Functions with Integral Minimizers. | Haotian Jiang |
| 2021 | Ultrasparse Ultrasparsifiers and Faster Laplacian System Solvers. | Arun Jambulapati, Aaron Sidford |
| 2021 | Optimal Oblivious Priority Queues. | Zahra Jafargholi, Kasper Green Larsen, Mark Simkin |