| 2021 | Learning Stochastic Decision Trees. | Guy Blanc, Jane Lange, Li-Yang Tan |
| 2021 | Counting Short Vector Pairs by Inner Product and Relations to the Permanent. | Andreas Bjrklund, Petteri Kaski |
| 2021 | Traveling Repairperson, Unrelated Machines, and Other Stories About Average Completion Times. | Marcin Bienkowski, Artur Kraska, Hsiang-Hsuan Liu |
| 2021 | Deterministic Rounding of Dynamic Fractional Matchings. | Sayan Bhattacharya, Peter Kiss |
| 2021 | Using a Geometric Lens to Find k Disjoint Shortest Paths. | Matthias Bentert, Andr Nichterlein, Malte Renken, Philipp Zschoche |
| 2021 | Strong Approximate Consensus Halving and the Borsuk-Ulam Theorem. | Eleni Batziou, Kristoffer Arnsfelt Hansen, Kasper Hgh |
| 2021 | Property Testing of Regular Languages with Applications to Streaming Property Testing of Visibly Pushdown Languages. | Gabriel Bathie, Tatiana Starikovskaya |
| 2021 | How to Send a Real Number Using a Single Bit (And Some Shared Randomness). | Ran Ben Basat, Michael Mitzenmacher, Shay Vargaftik |
| 2021 | On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications. | Sayan Bandyapadhyay, Fedor V. Fomin, Kirill Simonov |
| 2021 | The Submodular Santa Claus Problem in the Restricted Assignment Case. | tienne Bamas, Paritosh Garg, Lars Rohwedder |
| 2021 | Optimal Spectral-Norm Approximate Minimization of Weighted Finite Automata. | Borja Balle, Clara Lacroce, Prakash Panangaden, Doina Precup, Guillaume Rabusseau |
| 2021 | A Rice's Theorem for Abstract Semantics. | Paolo Baldan, Francesco Ranzato, Linpeng Zhang |
| 2021 | Revisiting Priority k-Center: Fairness and Outliers. | Tanvi Bajpai, Deeparnab Chakrabarty, Chandra Chekuri, Maryam Negahbani |
| 2021 | From Verification to Causality-Based Explications (Invited Talk). | Christel Baier, Clemens Dubslaff, Florian Funke, Simon Jantsch, Rupak Majumdar, Jakob Piribauer, Robin Ziemek |
| 2021 | Optimal Fine-Grained Hardness of Approximation of Linear Equations. | Mitali Bafna, Nikhil Vyas |
| 2021 | Beating Two-Thirds For Random-Order Streaming Matching. | Sepehr Assadi, Soheil Behnezhad |
| 2021 | Relaxed Locally Correctable Codes with Improved Parameters. | Vahid R. Asadi, Igor Shinkar |
| 2021 | Quantum Algorithms for Matrix Scaling and Matrix Balancing. | Joran van Apeldoorn, Sander Gribling, Yinan Li, Harold Nieuwboer, Michael Walter, Ronald de Wolf |
| 2021 | Breaking the Barrier Of 2 for the Competitiveness of Longest Queue Drop. | Antonios Antoniadis, Matthias Englert, Nicolaos Matsakis, Pavel Vesel |
| 2021 | Comparative Design-Choice Analysis of Color Refinement Algorithms Beyond the Worst Case. | Markus Anders, Pascal Schweitzer, Florian Wetzels |
| 2021 | Search Problems in Trees with Symmetries: Near Optimal Traversal Strategies for Individualization-Refinement Algorithms. | Markus Anders, Pascal Schweitzer |
| 2021 | Dynamic Membership for Regular Languages. | Antoine Amarilli, Louis Jachiet, Charles Paperman |
| 2021 | Efficient Splitting of Necklaces. | Noga Alon, Andrei Graur |
| 2021 | Improved Approximation for Longest Common Subsequence over Small Alphabets. | Shyan Akmal, Virginia Vassilevska Williams |
| 2021 | Faster Algorithms for Bounded Tree Edit Distance. | Shyan Akmal, Ce Jin |