| 2021 | Coherent Control and Distinguishability of Quantum Channels via PBS-Diagrams. | Cyril Branciard, Alexandre Clment, Mehdi Mhalla, Simon Perdrix |
| 2021 | Computational Complexity of Covering Multigraphs with Semi-Edges: Small Cases. | Jan Bok, Jir Fiala, Petr Hlinen, Nikola Jedlickov, Jan Kratochvl |
| 2021 | Constructing Deterministic ω-Automata from Examples by an Extension of the RPNI Algorithm. | Len Bohn, Christof Lding |
| 2021 | ω-Forest Algebras and Temporal Logics. | Achim Blumensath, Jakub Ldl |
| 2021 | Space-Efficient Fault-Tolerant Diameter Oracles. | Davide Bil, Sarel Cohen, Tobias Friedrich, Martin Schirneck |
| 2021 | Graph Traversals as Universal Constructions. | Siddharth Bhaskar, Robin Kaarsgaard |
| 2021 | Ideal Membership Problem for Boolean Minority and Dual Discriminator. | Arpitha P. Bharathi, Monaldo Mastrolilli |
| 2021 | Decision Questions for Probabilistic Automata on Small Alphabets. | Paul C. Bell, Pavel Semukhin |
| 2021 | Parameterized Complexity of Feature Selection for Categorical Data Clustering. | Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Kirill Simonov |
| 2021 | (Un)Decidability for History Preserving True Concurrent Logics. | Paolo Baldan, Alberto Carraro, Tommaso Padoan |
| 2021 | A Generic Strategy Improvement Method for Simple Stochastic Games. | David Auger, Xavier Badin de Montjoye, Yann Strozecki |
| 2021 | Finitely Tractable Promise Constraint Satisfaction Problems. | Kristina Asimi, Libor Barto |
| 2021 | Equivalence Testing of Weighted Automata over Partially Commutative Monoids. | Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay |
| 2021 | Order Reconfiguration Under Width Constraints. | Emmanuel Arrighi, Henning Fernau, Mateus de Oliveira Oliveira, Petra Wolf |
| 2021 | Universal Gauge-Invariant Cellular Automata. | Pablo Arrighi, Marin Costes, Nathanal Eon |
| 2021 | Depth-First Search in Directed Planar Graphs, Revisited. | Eric Allender, Archit Chauhan, Samir Datta |
| 2021 | Abstract Congruence Criteria for Weak Bisimilarity. | Stelios Tsampas, Christian Williams, Andreas Nuyts, Dominique Devriese, Frank Piessens |
| 2021 | A Linear-Time Nominal μ-Calculus with Name Allocation. | Daniel Hausmann, Stefan Milius, Lutz Schrder |
| 2021 | Idempotent Turing Machines. | Keisuke Nakano |
| 2020 | Front Matter, Table of Contents, Preface, Conference Organization. | |
| 2020 | List-Decodability of Structured Ensembles of Codes (Invited Talk). | Mary Wootters |
| 2020 | The Combined Basic LP and Affine IP Relaxation for Promise VCSPs on Infinite Domains. | Caterina Viola, Stanislav Zivn |
| 2020 | An Improved Approximation Algorithm for Scheduling Under Arborescence Precedence Constraints. | Kim Thang Nguyen |
| 2020 | Classically Simulating Quantum Circuits with Local Depolarizing Noise. | Yasuhiro Takahashi, Yuki Takeuchi, Seiichiro Tani |
| 2020 | Hitting Forbidden Induced Subgraphs on Bounded Treewidth Graphs. | Ignasi Sau, Uverton dos Santos Souza |