Table of Contents

• Parallel Algorithms for Power Circuits and the Word Problem of the Baumslag GroupCaroline Mattes, Armin Weiß. [doi]
• Graph Traversals as Universal ConstructionsSiddharth Bhaskar, Robin Kaarsgaard. [doi]
• Idempotent Turing MachinesKeisuke Nakano 0001. [doi]
• Finitely Tractable Promise Constraint Satisfaction ProblemsKristina Asimi, Libor Barto. [doi]
• A Decidable Equivalence for a Turing-Complete, Distributed Model of ComputationArnaldo Cesco, Roberto Gorrieri. [doi]
• A Bit of Nondeterminism Makes Pushdown Automata Expressive and SuccinctShibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann 0002. [doi]
• A Generic Strategy Improvement Method for Simple Stochastic GamesDavid Auger, Xavier Badin de Montjoye, Yann Strozecki. [doi]
• On Deciding Linear Arithmetic Constraints Over p-adic Integers for All PrimesChristoph Haase, Alessio Mansutti. [doi]
• Decision Problems for Origin-Close Top-Down Tree TransducersSarah Winter. [doi]
• The Pseudo-Skolem Problem is DecidableJulian D'Costa, Toghrul Karimov, Rupak Majumdar, Joël Ouaknine, Mahmoud Salamati, Sadegh Soudjani, James Worrell 0001. [doi]
• Griddings of Permutations and Hardness of Pattern MatchingVít Jelínek, Michal Opler, Jakub Pekárek. [doi]
• On Guidable Index of Tree AutomataDamian Niwinski, Michal Skrzypczak. [doi]
• The Power of One Clean Qubit in Communication ComplexityHartmut Klauck, Debbie Lim. [doi]
• The Gödel FibrationDavide Trotta, Matteo Spadetto, Valeria de Paiva. [doi]
• Optimal Regular Expressions for Palindromes of Given LengthHermann Gruber, Markus Holzer 0001. [doi]
• Reconfiguring Independent Sets on Interval GraphsMarcin Brianski, Stefan Felsner, Jedrzej Hodor, Piotr Micek. [doi]
• Fuzzy Simultaneous CongruencesMax A. Deppert, Klaus Jansen, Kim-Manuel Klein. [doi]
• (Un)Decidability for History Preserving True Concurrent LogicsPaolo Baldan, Alberto Carraro, Tommaso Padoan. [doi]
• Syntactic Minimization Of Nondeterministic Finite AutomataRobert S. R. Myers, Henning Urbat. [doi]
• Graph Characterization of the Universal Theory of RelationsAmina Doumane. [doi]
• Temporal Reachability Minimization: Delaying vs. DeletingHendrik Molter, Malte Renken, Philipp Zschoche. [doi]
• The Simplest Non-Regular Deterministic Context-Free LanguagePetr Jancar, Jirí Síma. [doi]
• Ergodic Theorems and Converses for PSPACE FunctionsSatyadev Nandakumar, Subin Pulari. [doi]
• Dots & Boxes Is PSPACE-CompleteKevin Buchin, Mart Hagedoorn, Irina Kostitsyna, Max van Mulken. [doi]
• A Note on the Join of Varieties of Monoids with LINathan Grosshans. [doi]
• On the Complexity of the Escape Problem for Linear Dynamical Systems over Compact Semialgebraic SetsJulian D'Costa, Engel Lefaucheux, Eike Neumann, Joël Ouaknine, James Worrell 0001. [doi]
• Keyboards as a New Model of ComputationYoan Géran, Bastien Laboureix, Corto Mascle, Valentin D. Richard. [doi]
• Matching Patterns with Variables Under Hamming DistancePawel Gawrychowski, Florin Manea, Stefan Siemer. [doi]
• Boolean Automata and Atoms of Regular LanguagesHellis Tamm. [doi]
• Black-Box Hypotheses and Lower BoundsBrynmor Chapman, R. Ryan Williams. [doi]
• A Homological Condition on Equational UnifiabilityMirai Ikebuchi. [doi]
• Sets of Linear Forms Which Are Hard to ComputeMichael Kaminski, Igor E. Shparlinski. [doi]
• Quantum Speedups for Dynamic Programming on n-Dimensional Lattice GraphsAdam Glos, Martins Kokainis, Ryuhei Mori, Jevgenijs Vihrovs. [doi]
• A Linear-Time Nominal μ-Calculus with Name AllocationDaniel Hausmann 0001, Stefan Milius, Lutz Schröder. [doi]
• Fractional Homomorphism, Weisfeiler-Leman Invariance, and the Sherali-Adams Hierarchy for the Constraint Satisfaction ProblemSilvia Butti, Víctor Dalmau. [doi]
• Quantum Multiple-Valued Decision Diagrams in Graphical CalculiRenaud Vilmart. [doi]
• Finite Convergence of μ-Calculus Fixpoints on Genuinely Infinite StructuresFlorian Bruse, Marco Sälzer, Martin Lange. [doi]
• Connecting Constructive Notions of Ordinals in Homotopy Type TheoryNicolai Kraus, Fredrik Nordvall Forsberg, Chuangjie Xu. [doi]
• An Approximation Algorithm for the Matrix Tree Multiplication ProblemMahmoud Abo Khamis, Ryan R. Curtin, Sungjin Im, Benjamin Moseley, Hung Q. Ngo 0001, Kirk Pruhs, Alireza Samadian. [doi]
• Decision Questions for Probabilistic Automata on Small AlphabetsPaul C. Bell, Pavel Semukhin. [doi]
• Order Reconfiguration Under Width ConstraintsEmmanuel Arrighi, Henning Fernau, Mateus de Oliveira Oliveira, Petra Wolf 0002. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• A Hierarchy of NondeterminismBader Abu Radi, Orna Kupferman, Ofer Leshkowitz. [doi]
• Constructing Deterministic ω-Automata from Examples by an Extension of the RPNI AlgorithmLeón Bohn, Christof Löding. [doi]
• A Deep Dive into the Weisfeiler-Leman Algorithm (Invited Talk)Martin Grohe. [doi]
• Pebble Transducers with Unary OutputGaëtan Douéneau-Tabot. [doi]
• Diameter Versus Certificate Complexity of Boolean FunctionsSiddhesh Chaubal, Anna Gál. [doi]
• Geometry of Interaction for ZX-DiagramsKostia Chardonnet, Benoît Valiron, Renaud Vilmart. [doi]
• Improved Upper Bounds for the Rigidity of Kronecker ProductsBohdan Kivva. [doi]
• Space-Efficient Fault-Tolerant Diameter OraclesDavide Bilò, Sarel Cohen, Tobias Friedrich 0001, Martin Schirneck. [doi]
• On the Hardness of Compressing WeightsBart M. P. Jansen, Shivesh K. Roy, Michal Wlodarczyk 0001. [doi]
• Parameterized Complexity of Feature Selection for Categorical Data ClusteringSayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Kirill Simonov. [doi]
• Depth-First Search in Directed Planar Graphs, RevisitedEric Allender, Archit Chauhan, Samir Datta. [doi]
• Recursive Backdoors for SATNikolas Mählmann, Sebastian Siebertz, Alexandre Vigny. [doi]
• ω-Forest Algebras and Temporal LogicsAchim Blumensath, Jakub Lédl. [doi]
• On Positivity and Minimality for Second-Order Holonomic SequencesGeorge Kenison, Oleksiy Klurman, Engel Lefaucheux, Florian Luca, Pieter Moree, Joël Ouaknine, Markus A. Whiteland, James Worrell 0001. [doi]
• On Dynamic Graphs (Invited Talk)Eva Rotenberg. [doi]
• Stabilization Bounds for Influence Propagation from a Random Initial StatePál András Papp, Roger Wattenhofer. [doi]
• On the Relative Power of Linear Algebraic Approximations of Graph IsomorphismAnuj Dawar, Danny Vagnozzi. [doi]
• Lower Bounds on Avoiding ThresholdsRobert Ferens, Marek Szykula, Vojtech Vorel. [doi]
• Universal Gauge-Invariant Cellular AutomataPablo Arrighi, Marin Costes, Nathanaël Eon. [doi]
• Computational Complexity of Covering Multigraphs with Semi-Edges: Small CasesJan Bok, Jirí Fiala 0001, Petr Hlinený, Nikola Jedlicková, Jan Kratochvíl. [doi]
• Maximum Cut on Interval Graphs of Interval Count Four Is NP-CompleteCelina M. H. de Figueiredo, Alexsander Andrade de Melo, Fabiano de S. Oliveira, Ana Silva 0001. [doi]
• The Complexity of Transitively Orienting Temporal GraphsGeorge B. Mertzios, Hendrik Molter, Malte Renken, Paul G. Spirakis, Philipp Zschoche. [doi]
• Abstract Congruence Criteria for Weak BisimilarityStelios Tsampas 0001, Christian Williams, Andreas Nuyts, Dominique Devriese, Frank Piessens. [doi]
• On Search Complexity of Discrete LogarithmPavel Hubácek, Jan Václavek. [doi]
• Non-Axiomatizability of the Equational Theories of Positive Relation Algebras (Invited Talk)Amina Doumane. [doi]
• A Cubic Vertex-Kernel for Trivially Perfect EditingMaël Dumas, Anthony Perez 0001, Ioan Todinca. [doi]
• Test of Quantumness with Small-Depth Quantum CircuitsShuichi Hirahara, François Le Gall. [doi]
• Perfect Forests in Graphs and Their ExtensionsGregory Z. Gutin, Anders Yeo. [doi]
• On Computing the Average Distance for Some Chordal-Like GraphsGuillaume Ducoffe . [doi]
• Sublinear Algorithms for Edit Distance (Invited Talk)Barna Saha. [doi]
• Budgeted Dominating Sets in Uncertain GraphsKeerti Choudhary, Avi Cohen, N. S. Narayanaswamy, David Peleg, R. Vijayaragunathan. [doi]
• Holonomic Techniques, Periods, and Decision Problems (Invited Talk)Joël Ouaknine. [doi]
• Parameterized (Modular) Counting and Cayley Graph ExpandersNorbert Peyerimhoff, Marc Roth, Johannes Schmitt 0002, Jakob Stix, Alina Vdovina. [doi]
• Online Domination: The Value of Getting to Know All Your NeighborsHovhannes A. Harutyunyan, Denis Pankratov, Jesse Racicot. [doi]
• Isometric Embeddings in Trees and Their Use in Distance ProblemsGuillaume Ducoffe . [doi]
• Ideal Membership Problem for Boolean Minority and Dual DiscriminatorArpitha P. Bharathi, Monaldo Mastrolilli. [doi]
• Maximum Votes Pareto-Efficient Allocations via Swaps on a Social NetworkFu Li, Xiong Zheng. [doi]
• Co-Degeneracy and Co-Treewidth: Using the Complement to Solve Dense InstancesGabriel L. Duarte, Mateus de Oliveira Oliveira, Uéverton S. Souza. [doi]
• Uncertain Curve SimplificationKevin Buchin, Maarten Löffler, Aleksandr Popov 0001, Marcel Roeloffzen. [doi]
• Obstructing Classification via ProjectionPantea Haghighatkhah, Wouter Meulemans, Bettina Speckmann, Jérôme Urhausen, Kevin Verbeek. [doi]
• A Recursion-Theoretic Characterization of the Probabilistic Class PPUgo Dal Lago, Reinhard Kahle, Isabel Oitavem. [doi]
• Finite Models for a Spatial Logic with Discrete and Topological Path OperatorsSven Linker, Fabio Papacchini, Michele Sevegnani. [doi]
• Equivalence Testing of Weighted Automata over Partially Commutative MonoidsVikraman Arvind, Abhranil Chatterjee 0001, Rajit Datta, Partha Mukhopadhyay. [doi]
• A Timecop's Chase Around the TableNils Morawietz, Petra Wolf 0002. [doi]
• Coherent Control and Distinguishability of Quantum Channels via PBS-DiagramsCyril Branciard, Alexandre Clément, Mehdi Mhalla, Simon Perdrix. [doi]
• Parallel Polynomial Permanent Mod Powers of 2 and Shortest Disjoint CyclesSamir Datta, Kishlaya Jaiswal. [doi]
• HyperLTL Satisfiability Is Σ₁¹-Complete, HyperCTL* Satisfiability Is Σ₁²-CompleteMarie Fortin, Louwe B. Kuijer, Patrick Totzke, Martin Zimmermann 0002. [doi]
• Ordered Fragments of First-Order LogicReijo Jaakkola. [doi]
• Feedback Vertex Set and Even Cycle Transversal for H-Free Graphs: Finding Large Block GraphsGiacomo Paesani, Daniël Paulusma, Pawel Rzazewski. [doi]