| 2021 | Separations for Estimating Large Frequency Moments on Data Streams. | David P. Woodruff, Samson Zhou |
| 2021 | A Very Sketchy Talk (Invited Talk). | David P. Woodruff |
| 2021 | Fourier Conjectures, Correlation Bounds, and Majority. | Emanuele Viola |
| 2021 | Guarded Kleene Algebra with Tests: Coequations, Coinduction, and Completeness. | Todd Schmid, Tobias Kapp, Dexter Kozen, Alexandra Silva |
| 2021 | The Greedy Algorithm Is not Optimal for On-Line Edge Coloring. | Amin Saberi, David Wajc |
| 2021 | Detecting and Counting Small Subgraphs, and Evaluating a Parameterized Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph Expanders. | Marc Roth, Johannes Schmitt, Philip Wellnitz |
| 2021 | Multiple Random Walks on Graphs: Mixing Few to Cover Many. | Nicols Rivera, Thomas Sauerwald, John Sylvester |
| 2021 | Fluted Logic with Counting. | Ian Pratt-Hartmann |
| 2021 | Algebraic Proof Systems (Invited Talk). | Toniann Pitassi |
| 2021 | The Structure of Minimum Vertex Cuts. | Seth Pettie, Longhui Yin |
| 2021 | Non-Mergeable Sketching for Cardinality Estimation. | Seth Pettie, Dingyu Wang, Longhui Yin |
| 2021 | Matching on the Line Admits No o(√log n)-Competitive Algorithm. | Enoch Peserico, Michele Scquizzato |
| 2021 | Higher-Order Model Checking Step by Step. | Pawel Parys |
| 2021 | Application of the Level-2 Quantum Lasserre Hierarchy in Quantum Approximation Algorithms. | Ojas Parekh, Kevin Thompson |
| 2021 | Optimal-Time Queries on BWT-Runs Compressed Indexes. | Takaaki Nishimoto, Yasuo Tabei |
| 2021 | Comparison-Free Polyregular Functions. | L Thnh Dung Nguyn, Camille Nos, Ccilia Pradic |
| 2021 | New Sublinear Algorithms and Lower Bounds for LIS Estimation. | Ilan Newman, Nithin Varma |
| 2021 | Decision Problems for Second-Order Holonomic Recurrences. | Eike Neumann, Jol Ouaknine, James Worrell |
| 2021 | Testing Dynamic Environments: Back to Basics. | Yonatan Nakar, Dana Ron |
| 2021 | Smooth Approximations and Relational Width Collapses. | Antoine Mottet, Toms Nagy, Michael Pinsker, Michal Wrona |
| 2021 | Relational Algorithms for k-Means Clustering. | Benjamin Moseley, Kirk Pruhs, Alireza Samadian, Yuyan Wang |
| 2021 | Playing Stochastically in Weighted Timed Games to Emulate Memory. | Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier |
| 2021 | High-Girth Near-Ramanujan Graphs with Lossy Vertex Expansion. | Theo McKenzie, Sidhanth Mohanty |
| 2021 | Degrees and Gaps: Tight Complexity Results of General Factor Problems Parameterized by Treewidth and Cutwidth. | Dniel Marx, Govind S. Sankar, Philipp Schepper |
| 2021 | An Efficient Coding Theorem via Probabilistic Representations and Its Applications. | Zhenjian Lu, Igor C. Oliveira |