| 2021 | Lee-Yang zeros and the complexity of the ferromagnetic Ising Model on bounded-degree graphs. | Pjotr Buys, Andreas Galanis, Viresh Patel, Guus Regts |
| 2021 | Approximating ( | Maike Buchin, Anne Driemel, Dennis Rohde |
| 2021 | Online Multiserver Convex Chasing and Optimization. | Sbastien Bubeck, Yuval Rabani, Mark Sellke |
| 2021 | On Near-Linear-Time Algorithms for Dense Subset Sum. | Karl Bringmann, Philip Wellnitz |
| 2021 | A Fine-Grained Perspective on Approximating Subset Sum and Partition. | Karl Bringmann, Vasileios Nakos |
| 2021 | Coresets for Clustering in Excluded-minor Graphs and Beyond. | Vladimir Braverman, Shaofeng H.-C. Jiang, Robert Krauthgamer, Xuan Wu |
| 2021 | On the Mysteries of MAX NAE-SAT. | Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick |
| 2021 | Twin-width II: small classes. | douard Bonnet, Colin Geniet, Eun Jung Kim, Stphan Thomass, Rmi Watrigant |
| 2021 | Optimal Vertex Fault-Tolerant Spanners in Polynomial Time. | Greg Bodwin, Michael Dinitz, Caleb Robelle |
| 2021 | The Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability. | Thomas Blsius, Tobias Friedrich, Andreas Gbel, Jordi Levy, Ralf Rothenberger |
| 2021 | On the Orbit Closure Containment Problem and Slice Rank of Tensors. | Markus Blser, Christian Ikenmeyer, Vladimir Lysikov, Anurag Pandey, Frank-Olaf Schreyer |
| 2021 | Query strategies for priced information, revisited. | Guy Blanc, Jane Lange, Li-Yang Tan |
| 2021 | The Fine-Grained Complexity of Computing the Tutte Polynomial of a Linear Matroid. | Andreas Bjrklund, Petteri Kaski |
| 2021 | Dynamic Set Cover: Improved Amortized and Worst-Case Update Time. | Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Xiaowei Wu |
| 2021 | Online Edge Coloring Algorithms via the Nibble Method. | Sayan Bhattacharya, Fabrizio Grandoni, David Wajc |
| 2021 | New Techniques and Fine-Grained Hardness for Dynamic Near-Additive Spanners. | Thiago Bergamaschi, Monika Henzinger, Maximilian Probst Gutenberg, Virginia Vassilevska Williams, Nicole Wein |
| 2021 | Near-Linear Time Homomorphism Counting in Bounded Degeneracy Graphs: The Barrier of Long Induced Cycles. | Suman K. Bera, Noujan Pashanasangi, C. Seshadhri |
| 2021 | Randomized Cup Game Algorithms Against Strong Adversaries. | Michael A. Bender, William Kuszmaul |
| 2021 | Self-Stabilizing Clock Synchronization with 1-bit Messages. | Paul Bastide, George Giakkoupis, Hayk Saribekyan |
| 2021 | Online Discrepancy Minimization for Stochastic Arrivals. | Nikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla, Makrand Sinha |
| 2021 | Improved Approximations for Min Sum Vertex Cover and Generalized Min Sum Set Cover. | Nikhil Bansal, Jatin Batra, Majid Farhadi, Prasad Tetali |
| 2021 | Non-uniform Geometric Set Cover and Scheduling on Multiple Machines. | Nikhil Bansal, Jatin Batra |
| 2021 | Local Statistics, Semidefinite Programming, and Community Detection. | Jess Banks, Sidhanth Mohanty, Prasad Raghavendra |
| 2021 | Non-Excludable Dynamic Mechanism Design. | Santiago R. Balseiro, Vahab S. Mirrokni, Renato Paes Leme, Song Zuo |
| 2021 | Connecting Robust Shuffle Privacy and Pan-Privacy. | Victor Balcer, Albert Cheu, Matthew Joseph, Jieming Mao |