| 2021 | (Un)Decidability for History Preserving True Concurrent Logics. Paolo Baldan, Alberto Carraro, Tommaso Padoan |
| 2021 | 46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021, Tallinn, Estonia, August 23-27, 2021 Filippo Bonchi, Simon J. Puglisi |
| 2021 | A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct. Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann |
| 2021 | A Cubic Vertex-Kernel for Trivially Perfect Editing. Maël Dumas, Anthony Perez, Ioan Todinca |
| 2021 | A Decidable Equivalence for a Turing-Complete, Distributed Model of Computation. Arnaldo Cesco, Roberto Gorrieri |
| 2021 | A Deep Dive into the Weisfeiler-Leman Algorithm (Invited Talk). Martin Grohe |
| 2021 | A Generic Strategy Improvement Method for Simple Stochastic Games. David Auger, Xavier Badin de Montjoye, Yann Strozecki |
| 2021 | A Hierarchy of Nondeterminism. Bader Abu Radi, Orna Kupferman, Ofer Leshkowitz |
| 2021 | A Homological Condition on Equational Unifiability. Mirai Ikebuchi |
| 2021 | A Linear-Time Nominal μ-Calculus with Name Allocation. Daniel Hausmann, Stefan Milius, Lutz Schröder |
| 2021 | A Note on the Join of Varieties of Monoids with LI. Nathan Grosshans |
| 2021 | A Recursion-Theoretic Characterization of the Probabilistic Class PP. Ugo Dal Lago, Reinhard Kahle, Isabel Oitavem |
| 2021 | A Timecop's Chase Around the Table. Nils Morawietz, Petra Wolf |
| 2021 | Abstract Congruence Criteria for Weak Bisimilarity. Stelios Tsampas, Christian Williams, Andreas Nuyts, Dominique Devriese, Frank Piessens |
| 2021 | An Approximation Algorithm for the Matrix Tree Multiplication Problem. Mahmoud Abo Khamis, Ryan R. Curtin, Sungjin Im, Benjamin Moseley, Hung Q. Ngo, Kirk Pruhs, Alireza Samadian |
| 2021 | Black-Box Hypotheses and Lower Bounds. Brynmor Chapman, R. Ryan Williams |
| 2021 | Boolean Automata and Atoms of Regular Languages. Hellis Tamm |
| 2021 | Budgeted Dominating Sets in Uncertain Graphs. Keerti Choudhary, Avi Cohen, N. S. Narayanaswamy, David Peleg, R. Vijayaragunathan |
| 2021 | Co-Degeneracy and Co-Treewidth: Using the Complement to Solve Dense Instances. Gabriel L. Duarte, Mateus de Oliveira Oliveira, Uéverton S. Souza |
| 2021 | Coherent Control and Distinguishability of Quantum Channels via PBS-Diagrams. Cyril Branciard, Alexandre Clément, Mehdi Mhalla, Simon Perdrix |
| 2021 | Computational Complexity of Covering Multigraphs with Semi-Edges: Small Cases. Jan Bok, Jirí Fiala, Petr Hlinený, Nikola Jedlicková, Jan Kratochvíl |
| 2021 | Connecting Constructive Notions of Ordinals in Homotopy Type Theory. Nicolai Kraus, Fredrik Nordvall Forsberg, Chuangjie Xu |
| 2021 | Constructing Deterministic ω-Automata from Examples by an Extension of the RPNI Algorithm. León Bohn, Christof Löding |
| 2021 | Decision Problems for Origin-Close Top-Down Tree Transducers. Sarah Winter |
| 2021 | Decision Questions for Probabilistic Automata on Small Alphabets. Paul C. Bell, Pavel Semukhin |
| 2021 | Depth-First Search in Directed Planar Graphs, Revisited. Eric Allender, Archit Chauhan, Samir Datta |
| 2021 | Diameter Versus Certificate Complexity of Boolean Functions. Siddhesh Chaubal, Anna Gál |
| 2021 | Dots & Boxes Is PSPACE-Complete. Kevin Buchin, Mart Hagedoorn, Irina Kostitsyna, Max van Mulken |
| 2021 | Equivalence Testing of Weighted Automata over Partially Commutative Monoids. Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay |
| 2021 | Ergodic Theorems and Converses for PSPACE Functions. Satyadev Nandakumar, Subin Pulari |
| 2021 | Feedback Vertex Set and Even Cycle Transversal for H-Free Graphs: Finding Large Block Graphs. Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski |
| 2021 | Finite Convergence of μ-Calculus Fixpoints on Genuinely Infinite Structures. Florian Bruse, Marco Sälzer, Martin Lange |
| 2021 | Finite Models for a Spatial Logic with Discrete and Topological Path Operators. Sven Linker, Fabio Papacchini, Michele Sevegnani |
| 2021 | Finitely Tractable Promise Constraint Satisfaction Problems. Kristina Asimi, Libor Barto |
| 2021 | Fractional Homomorphism, Weisfeiler-Leman Invariance, and the Sherali-Adams Hierarchy for the Constraint Satisfaction Problem. Silvia Butti, Víctor Dalmau |
| 2021 | Front Matter, Table of Contents, Preface, Conference Organization. |
| 2021 | Fuzzy Simultaneous Congruences. Max A. Deppert, Klaus Jansen, Kim-Manuel Klein |
| 2021 | Geometry of Interaction for ZX-Diagrams. Kostia Chardonnet, Benoît Valiron, Renaud Vilmart |
| 2021 | Graph Characterization of the Universal Theory of Relations. Amina Doumane |
| 2021 | Graph Traversals as Universal Constructions. Siddharth Bhaskar, Robin Kaarsgaard |
| 2021 | Griddings of Permutations and Hardness of Pattern Matching. Vít Jelínek, Michal Opler, Jakub Pekárek |
| 2021 | Holonomic Techniques, Periods, and Decision Problems (Invited Talk). Joël Ouaknine |
| 2021 | HyperLTL Satisfiability Is Σ₁¹-Complete, HyperCTL* Satisfiability Is Σ₁²-Complete. Marie Fortin, Louwe B. Kuijer, Patrick Totzke, Martin Zimmermann |
| 2021 | Ideal Membership Problem for Boolean Minority and Dual Discriminator. Arpitha P. Bharathi, Monaldo Mastrolilli |
| 2021 | Idempotent Turing Machines. Keisuke Nakano |
| 2021 | Improved Upper Bounds for the Rigidity of Kronecker Products. Bohdan Kivva |
| 2021 | Isometric Embeddings in Trees and Their Use in Distance Problems. Guillaume Ducoffe |
| 2021 | Keyboards as a New Model of Computation. Yoan Géran, Bastien Laboureix, Corto Mascle, Valentin D. Richard |
| 2021 | Lower Bounds on Avoiding Thresholds. Robert Ferens, Marek Szykula, Vojtech Vorel |
| 2021 | Matching Patterns with Variables Under Hamming Distance. Pawel Gawrychowski, Florin Manea, Stefan Siemer |
| 2021 | Maximum Cut on Interval Graphs of Interval Count Four Is NP-Complete. Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Fabiano de S. Oliveira, Ana Silva |
| 2021 | Maximum Votes Pareto-Efficient Allocations via Swaps on a Social Network. Fu Li, Xiong Zheng |
| 2021 | Non-Axiomatizability of the Equational Theories of Positive Relation Algebras (Invited Talk). Amina Doumane |
| 2021 | Obstructing Classification via Projection. Pantea Haghighatkhah, Wouter Meulemans, Bettina Speckmann, Jérôme Urhausen, Kevin Verbeek |
| 2021 | On Computing the Average Distance for Some Chordal-Like Graphs. Guillaume Ducoffe |
| 2021 | On Deciding Linear Arithmetic Constraints Over p-adic Integers for All Primes. Christoph Haase, Alessio Mansutti |
| 2021 | On Dynamic Graphs (Invited Talk). Eva Rotenberg |
| 2021 | On Guidable Index of Tree Automata. Damian Niwinski, Michal Skrzypczak |
| 2021 | On Positivity and Minimality for Second-Order Holonomic Sequences. George Kenison, Oleksiy Klurman, Engel Lefaucheux, Florian Luca, Pieter Moree, Joël Ouaknine, Markus A. Whiteland, James Worrell |
| 2021 | On Search Complexity of Discrete Logarithm. Pavel Hubácek, Jan Václavek |
| 2021 | On the Complexity of the Escape Problem for Linear Dynamical Systems over Compact Semialgebraic Sets. Julian D'Costa, Engel Lefaucheux, Eike Neumann, Joël Ouaknine, James Worrell |
| 2021 | On the Hardness of Compressing Weights. Bart M. P. Jansen, Shivesh Kumar Roy, Michal Wlodarczyk |
| 2021 | On the Relative Power of Linear Algebraic Approximations of Graph Isomorphism. Anuj Dawar, Danny Vagnozzi |
| 2021 | Online Domination: The Value of Getting to Know All Your Neighbors. Hovhannes A. Harutyunyan, Denis Pankratov, Jesse Racicot |
| 2021 | Optimal Regular Expressions for Palindromes of Given Length. Hermann Gruber, Markus Holzer |
| 2021 | Order Reconfiguration Under Width Constraints. Emmanuel Arrighi, Henning Fernau, Mateus de Oliveira Oliveira, Petra Wolf |
| 2021 | Ordered Fragments of First-Order Logic. Reijo Jaakkola |
| 2021 | Parallel Algorithms for Power Circuits and the Word Problem of the Baumslag Group. Caroline Mattes, Armin Weiß |
| 2021 | Parallel Polynomial Permanent Mod Powers of 2 and Shortest Disjoint Cycles. Samir Datta, Kishlaya Jaiswal |
| 2021 | Parameterized (Modular) Counting and Cayley Graph Expanders. Norbert Peyerimhoff, Marc Roth, Johannes Schmitt, Jakob Stix, Alina Vdovina |
| 2021 | Parameterized Complexity of Feature Selection for Categorical Data Clustering. Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Kirill Simonov |
| 2021 | Pebble Transducers with Unary Output. Gaëtan Douéneau-Tabot |
| 2021 | Perfect Forests in Graphs and Their Extensions. Gregory Z. Gutin, Anders Yeo |
| 2021 | Quantum Multiple-Valued Decision Diagrams in Graphical Calculi. Renaud Vilmart |
| 2021 | Quantum Speedups for Dynamic Programming on n-Dimensional Lattice Graphs. Adam Glos, Martins Kokainis, Ryuhei Mori, Jevgenijs Vihrovs |
| 2021 | Reconfiguring Independent Sets on Interval Graphs. Marcin Brianski, Stefan Felsner, Jedrzej Hodor, Piotr Micek |
| 2021 | Recursive Backdoors for SAT. Nikolas Mählmann, Sebastian Siebertz, Alexandre Vigny |
| 2021 | Sets of Linear Forms Which Are Hard to Compute. Michael Kaminski, Igor E. Shparlinski |
| 2021 | Space-Efficient Fault-Tolerant Diameter Oracles. Davide Bilò, Sarel Cohen, Tobias Friedrich, Martin Schirneck |
| 2021 | Stabilization Bounds for Influence Propagation from a Random Initial State. Pál András Papp, Roger Wattenhofer |
| 2021 | Sublinear Algorithms for Edit Distance (Invited Talk). Barna Saha |
| 2021 | Syntactic Minimization Of Nondeterministic Finite Automata. Robert S. R. Myers, Henning Urbat |
| 2021 | Temporal Reachability Minimization: Delaying vs. Deleting. Hendrik Molter, Malte Renken, Philipp Zschoche |
| 2021 | Test of Quantumness with Small-Depth Quantum Circuits. Shuichi Hirahara, François Le Gall |
| 2021 | The Complexity of Transitively Orienting Temporal Graphs. George B. Mertzios, Hendrik Molter, Malte Renken, Paul G. Spirakis, Philipp Zschoche |
| 2021 | The Gödel Fibration. Davide Trotta, Matteo Spadetto, Valeria de Paiva |
| 2021 | The Power of One Clean Qubit in Communication Complexity. Hartmut Klauck, Debbie Lim |
| 2021 | The Pseudo-Skolem Problem is Decidable. Julian D'Costa, Toghrul Karimov, Rupak Majumdar, Joël Ouaknine, Mahmoud Salamati, Sadegh Soudjani, James Worrell |
| 2021 | The Simplest Non-Regular Deterministic Context-Free Language. Petr Jancar, Jirí Síma |
| 2021 | Uncertain Curve Simplification. Kevin Buchin, Maarten Löffler, Aleksandr Popov, Marcel Roeloffzen |
| 2021 | Universal Gauge-Invariant Cellular Automata. Pablo Arrighi, Marin Costes, Nathanaël Eon |
| 2021 | ω-Forest Algebras and Temporal Logics. Achim Blumensath, Jakub Lédl |