| 591 | -- | 592 | Anuj Dawar. International Colloquium on Automata, Languages and Programming (ICALP 2020) |
| 593 | -- | 614 | Michaël Cadilhac, Filip Mazowiecki, Charles Paperman, Michal Pilipczuk, Géraud Sénizergues. On Polynomial Recursive Sequences |
| 615 | -- | 661 | Erik Paul. Finite Sequentiality of Finitely Ambiguous Max-Plus Tree Automata |
| 662 | -- | 739 | Joel D. Day, Florin Manea. On the structure of solution-sets to regular word equations |
| 740 | -- | 757 | Pawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski, Armin Weiß. Equation Satisfiability in Solvable Groups |
| 758 | -- | 772 | Aaron Bernstein. Improved Bounds for Matching in Random-Order Streams |
| 773 | -- | 813 | Uriel Feige, Vadim Grinberg. How to Hide a Clique? |
| 814 | -- | 834 | Pawel Gawrychowski, Shay Mozes, Oren Weimann. 2 n) Time |
| 835 | -- | 837 | Markus Bläser, Benjamin Monmege. Preface of STACS 2021 Special Issue |
| 838 | -- | 867 | Silvia Butti, Víctor Dalmau. The Complexity of the Distributed Constraint Satisfaction Problem |
| 868 | -- | 899 | Mahdi Cheraghchi, Shuichi Hirahara, Dimitrios Myrisiotis, Yuichi Yoshida. One-Tape Turing Machine and Branching Program Lower Bounds for MCSP |
| 900 | -- | 985 | Stefan Göller, Mathieu Hilaire. Reachability in Two-Parametric Timed Automata with one Parameter is EXPSPACE-Complete |
| 986 | -- | 1013 | Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos. Digraph Coloring and Distance to Acyclicity |
| 1014 | -- | 1048 | Jacob Holm, Eva Rotenberg. Good r-divisions Imply Optimal Amortized Decremental Biconnectivity |
| 1049 | -- | 1081 | Lars Jaffke, Paloma T. Lima, Daniel Lokshtanov. b-Coloring Parameterized by Clique-Width |
| 1082 | -- | 1107 | Markus Lohrey. Subgroup Membership in GL(2,Z) |