- Dmitry Gavinsky. The Layer Complexity of Arthur-Merlin-like Communication. Theory of Computing, 17:1-28, 2021.
- Jack Murtagh, Omer Reingold, Aaron Sidford, Salil P. Vadhan. Deterministic Approximation of Random Walks in Small Space. Theory of Computing, 17:1-35, 2021.
- Michael A. Forbes, Amir Shpilka, Iddo Tzameret, Avi Wigderson. Proof Complexity Lower Bounds from Algebraic Circuit Complexity. Theory of Computing, 17:1-88, 2021.
- Mark Bun, Justin Thaler. 0. Theory of Computing, 17:1-46, 2021.
- Julia Chuzhoy, David Hong Kyun Kim, Rachit Nimavat. Almost Polynomial Hardness of Node-Disjoint Paths in Grids. Theory of Computing, 17:1-57, 2021.
- Amir Abboud, Robert Krauthgamer, Ohad Trabelsi. New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs. Theory of Computing, 17:1-27, 2021.
- Matthias Christandl, Péter Vrana, Jeroen Zuiddam. Barriers for Fast Matrix Multiplication from Irreversibility. Theory of Computing, 17:1-32, 2021.
- Noga Ron-Zewi, Ivona Bezáková, László A. Végh. Special Issue: APPROX-RANDOM 2019: Guest Editors' Foreword. Theory of Computing, 17:1-4, 2021.
- Igor Carboni Oliveira, Ján Pich, Rahul Santhanam. Hardness Magnification Near State-of-the-Art Lower Bounds. Theory of Computing, 17:1-38, 2021.
- Josh Alman. Limits on the Universal Method for Matrix Multiplication. Theory of Computing, 17:1-30, 2021.