| 2021 | Quantum Relational Hoare Logic with Expectations. | Yangjia Li, Dominique Unruh |
| 2021 | Testing Triangle Freeness in the General Model in Graphs with Arboricity O(√n). | Reut Levi |
| 2021 | Minimum Stable Cut and Treewidth. | Michael Lampis |
| 2021 | On Counting (Quantum-)Graph Homomorphisms in Finite Fields of Prime Order. | J. A. Gregor Lagodzinski, Andreas Gbel, Katrin Casel, Tobias Friedrich |
| 2021 | SoS Certification for Symmetric Quadratic Functions and Its Connection to Constrained Boolean Hypercube Optimization. | Adam Kurpisz, Aaron Potechin, Elias Samuel Wirth |
| 2021 | Improving Gebauer's Construction of 3-Chromatic Hypergraphs with Few Edges. | Jakub Kozik |
| 2021 | Lower Bounds on Dynamic Programming for Maximum Weight Independent Set. | Tuukka Korhonen |
| 2021 | Automorphisms and Isomorphisms of Maps in Linear Time. | Ken-ichi Kawarabayashi, Bojan Mohar, Roman Nedela, Peter Zeman |
| 2021 | Maximum Matchings and Popularity. | Telikepalli Kavitha |
| 2021 | Coboundary and Cosystolic Expansion from Strong Symmetry. | Tali Kaufman, Izhar Oppenheim |
| 2021 | Fully Dynamic Algorithms for Minimum Weight Cycle and Related Problems. | Adam Karczmarz |
| 2021 | Quasi-Polynomial Time Algorithms for Free Quantum Games in Bounded Dimension. | Hyejung H. Jee, Carlo Sparaciari, Omar Fawzi, Mario Berta |
| 2021 | Kernelization, Proof Complexity and Social Choice. | Gabriel Istrate, Cosmin Bonchis, Adrian Craciun |
| 2021 | Minimum-Norm Load Balancing Is (Almost) as Easy as Minimizing Makespan. | Sharat Ibrahimpur, Chaitanya Swamy |
| 2021 | Approximating Maximum Integral Multiflows on Bounded Genus Graphs. | Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Jens Vygen |
| 2021 | Analysis of Smooth Heaps and Slim Heaps. | Maria Hartmann, Lszl Kozma, Corwin Sinnamon, Robert E. Tarjan |
| 2021 | Near-Optimal Schedules for Simultaneous Multicasts. | Bernhard Haeupler, D. Ellis Hershkowitz, David Wajc |
| 2021 | Constructing a Distance Sensitivity Oracle in O(n^2.5794 M) Time. | Yong Gu, Hanlin Ren |
| 2021 | Structural Iterative Rounding for Generalized k-Median Problems. | Anupam Gupta, Benjamin Moseley, Rudy Zhou |
| 2021 | Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement Paths. | Yuzhou Gu, Adam Polak, Virginia Vassilevska Williams, Yinzhan Xu |
| 2021 | Logarithmic Weisfeiler-Leman Identifies All Planar Graphs. | Martin Grohe, Sandra Kiefer |
| 2021 | Online Stochastic Matching with Edge Arrivals. | Nick Gravin, Zhihao Gavin Tang, Kangning Wang |
| 2021 | Elementary Equivalence Versus Isomorphism in Semiring Semantics. | Erich Grdel, Lovro Mrkonjic |
| 2021 | Quantum Logspace Algorithm for Powering Matrices with Bounded Norm. | Uma Girish, Ran Raz, Wei Zhan |
| 2021 | A Subexponential Algorithm for ARRIVAL. | Bernd Grtner, Sebastian Haslebacher, Hung P. Hoang |