@Proceedings{bonchi_et_al:LIPIcs.MFCS.2021,
title = {{LIPIcs, Volume 202, MFCS 2021, Complete Volume}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {1--1560},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021},
URN = {urn:nbn:de:0030-drops-144396},
doi = {10.4230/LIPIcs.MFCS.2021},
annote = {Keywords: LIPIcs, Volume 202, MFCS 2021, Complete Volume}
}
@InProceedings{bonchi_et_al:LIPIcs.MFCS.2021.0,
author = {Bonchi, Filippo and Puglisi, Simon J.},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {0:i--0:xvi},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.0},
URN = {urn:nbn:de:0030-drops-144409},
doi = {10.4230/LIPIcs.MFCS.2021.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{doumane:LIPIcs.MFCS.2021.1,
author = {Doumane, Amina},
title = {{Non-Axiomatizability of the Equational Theories of Positive Relation Algebras}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {1:1--1:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.1},
URN = {urn:nbn:de:0030-drops-144417},
doi = {10.4230/LIPIcs.MFCS.2021.1},
annote = {Keywords: Relation algebra, Graph homomorphism, Equational theories, First-order logic}
}
@InProceedings{grohe:LIPIcs.MFCS.2021.2,
author = {Grohe, Martin},
title = {{A Deep Dive into the Weisfeiler-Leman Algorithm}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {2:1--2:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.2},
URN = {urn:nbn:de:0030-drops-144429},
doi = {10.4230/LIPIcs.MFCS.2021.2},
annote = {Keywords: Weisfeiler-Leman algorithm, graph isomorphism, counting homomorphisms, finite variable logics}
}
@InProceedings{ouaknine:LIPIcs.MFCS.2021.3,
author = {Ouaknine, Jo\"{e}l},
title = {{Holonomic Techniques, Periods, and Decision Problems}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {3:1--3:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.3},
URN = {urn:nbn:de:0030-drops-144431},
doi = {10.4230/LIPIcs.MFCS.2021.3},
annote = {Keywords: Holonomic and hypergeometric sequences, Inequality problems, Continued fractions, Periods}
}
@InProceedings{rotenberg:LIPIcs.MFCS.2021.4,
author = {Rotenberg, Eva},
title = {{On Dynamic Graphs}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {4:1--4:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.4},
URN = {urn:nbn:de:0030-drops-144445},
doi = {10.4230/LIPIcs.MFCS.2021.4},
annote = {Keywords: Graph algorithms, dynamic graphs, connectivity, planarity, matching, online algorithms}
}
@InProceedings{saha:LIPIcs.MFCS.2021.5,
author = {Saha, Barna},
title = {{Sublinear Algorithms for Edit Distance}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {5:1--5:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.5},
URN = {urn:nbn:de:0030-drops-144452},
doi = {10.4230/LIPIcs.MFCS.2021.5},
annote = {Keywords: Edit distance, sublinear algorithms, string processing}
}
@InProceedings{abokhamis_et_al:LIPIcs.MFCS.2021.6,
author = {Abo-Khamis, Mahmoud and Curtin, Ryan and Im, Sungjin and Moseley, Benjamin and Ngo, Hung and Pruhs, Kirk and Samadian, Alireza},
title = {{An Approximation Algorithm for the Matrix Tree Multiplication Problem}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {6:1--6:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.6},
URN = {urn:nbn:de:0030-drops-144464},
doi = {10.4230/LIPIcs.MFCS.2021.6},
annote = {Keywords: Matrix Multiplication, Approximation Algorithm}
}
@InProceedings{allender_et_al:LIPIcs.MFCS.2021.7,
author = {Allender, Eric and Chauhan, Archit and Datta, Samir},
title = {{Depth-First Search in Directed Planar Graphs, Revisited}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {7:1--7:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.7},
URN = {urn:nbn:de:0030-drops-144478},
doi = {10.4230/LIPIcs.MFCS.2021.7},
annote = {Keywords: Depth-First Search, Planar Digraphs, Parallel Algorithms, Space-Bounded Complexity Classes}
}
@InProceedings{arrighi_et_al:LIPIcs.MFCS.2021.8,
author = {Arrighi, Emmanuel and Fernau, Henning and de Oliveira Oliveira, Mateus and Wolf, Petra},
title = {{Order Reconfiguration Under Width Constraints}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {8:1--8:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.8},
URN = {urn:nbn:de:0030-drops-144486},
doi = {10.4230/LIPIcs.MFCS.2021.8},
annote = {Keywords: Parameterized Complexity, Order Reconfiguration, String Rewriting Systems}
}
@InProceedings{arrighi_et_al:LIPIcs.MFCS.2021.9,
author = {Arrighi, Pablo and Costes, Marin and Eon, Nathana\"{e}l},
title = {{Universal Gauge-Invariant Cellular Automata}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {9:1--9:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.9},
URN = {urn:nbn:de:0030-drops-144490},
doi = {10.4230/LIPIcs.MFCS.2021.9},
annote = {Keywords: Cellular automata, Gauge-invariance, Universality}
}
@InProceedings{arvind_et_al:LIPIcs.MFCS.2021.10,
author = {Arvind, V. and Chatterjee, Abhranil and Datta, Rajit and Mukhopadhyay, Partha},
title = {{Equivalence Testing of Weighted Automata over Partially Commutative Monoids}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {10:1--10:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.10},
URN = {urn:nbn:de:0030-drops-144503},
doi = {10.4230/LIPIcs.MFCS.2021.10},
annote = {Keywords: Weighted Automata, Automata Equivalence, Partially Commutative Monoid}
}
@InProceedings{asimi_et_al:LIPIcs.MFCS.2021.11,
author = {Asimi, Kristina and Barto, Libor},
title = {{Finitely Tractable Promise Constraint Satisfaction Problems}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {11:1--11:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.11},
URN = {urn:nbn:de:0030-drops-144519},
doi = {10.4230/LIPIcs.MFCS.2021.11},
annote = {Keywords: Constraint satisfaction problems, promise constraint satisfaction, Boolean PCSP, polymorphism, finite tractability, homomorphic relaxation}
}
@InProceedings{auger_et_al:LIPIcs.MFCS.2021.12,
author = {Auger, David and Badin de Montjoye, Xavier and Strozecki, Yann},
title = {{A Generic Strategy Improvement Method for Simple Stochastic Games}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {12:1--12:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.12},
URN = {urn:nbn:de:0030-drops-144524},
doi = {10.4230/LIPIcs.MFCS.2021.12},
annote = {Keywords: Simple Stochastic Games, Strategy Improvement, Parametrized Complexity, Stopping, Meta Algorithm, f-strategy}
}
@InProceedings{baldan_et_al:LIPIcs.MFCS.2021.13,
author = {Baldan, Paolo and Carraro, Alberto and Padoan, Tommaso},
title = {{(Un)Decidability for History Preserving True Concurrent Logics}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {13:1--13:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.13},
URN = {urn:nbn:de:0030-drops-144532},
doi = {10.4230/LIPIcs.MFCS.2021.13},
annote = {Keywords: Event structures, history-preserving bisimilarity, true concurrent behavioural logics, satisfiability, decidability, domino systems}
}
@InProceedings{bandyapadhyay_et_al:LIPIcs.MFCS.2021.14,
author = {Bandyapadhyay, Sayan and Fomin, Fedor V. and Golovach, Petr A. and Simonov, Kirill},
title = {{Parameterized Complexity of Feature Selection for Categorical Data Clustering}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {14:1--14:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.14},
URN = {urn:nbn:de:0030-drops-144544},
doi = {10.4230/LIPIcs.MFCS.2021.14},
annote = {Keywords: Robust clustering, PCA, Low rank approximation, Hypergraph enumeration}
}
@InProceedings{bell_et_al:LIPIcs.MFCS.2021.15,
author = {Bell, Paul C. and Semukhin, Pavel},
title = {{Decision Questions for Probabilistic Automata on Small Alphabets}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {15:1--15:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.15},
URN = {urn:nbn:de:0030-drops-144559},
doi = {10.4230/LIPIcs.MFCS.2021.15},
annote = {Keywords: Probabilistic finite automata, unary alphabet, emptiness problem, bounded ambiguity}
}
@InProceedings{bharathi_et_al:LIPIcs.MFCS.2021.16,
author = {Bharathi, Arpitha P. and Mastrolilli, Monaldo},
title = {{Ideal Membership Problem for Boolean Minority and Dual Discriminator}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {16:1--16:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.16},
URN = {urn:nbn:de:0030-drops-144560},
doi = {10.4230/LIPIcs.MFCS.2021.16},
annote = {Keywords: Polynomial ideal membership, Polymorphisms, Gr\"{o}bner basis theory, Constraint satisfaction problems}
}
@InProceedings{bhaskar_et_al:LIPIcs.MFCS.2021.17,
author = {Bhaskar, Siddharth and Kaarsgaard, Robin},
title = {{Graph Traversals as Universal Constructions}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {17:1--17:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.17},
URN = {urn:nbn:de:0030-drops-144573},
doi = {10.4230/LIPIcs.MFCS.2021.17},
annote = {Keywords: graph traversals, adjunctions, universal constructions, category theory}
}
@InProceedings{bilo_et_al:LIPIcs.MFCS.2021.18,
author = {Bil\`{o}, Davide and Cohen, Sarel and Friedrich, Tobias and Schirneck, Martin},
title = {{Space-Efficient Fault-Tolerant Diameter Oracles}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {18:1--18:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.18},
URN = {urn:nbn:de:0030-drops-144581},
doi = {10.4230/LIPIcs.MFCS.2021.18},
annote = {Keywords: derandomization, diameter, distance sensitivity oracle, fault-tolerant data structure, space lower bound}
}
@InProceedings{blumensath_et_al:LIPIcs.MFCS.2021.19,
author = {Blumensath, Achim and L\'{e}dl, Jakub},
title = {{\omega-Forest Algebras and Temporal Logics}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {19:1--19:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.19},
URN = {urn:nbn:de:0030-drops-144594},
doi = {10.4230/LIPIcs.MFCS.2021.19},
annote = {Keywords: forest algebras, temporal logics, bisimulation}
}
@InProceedings{bohn_et_al:LIPIcs.MFCS.2021.20,
author = {Bohn, Le\'{o}n and L\"{o}ding, Christof},
title = {{Constructing Deterministic \omega-Automata from Examples by an Extension of the RPNI Algorithm}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {20:1--20:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.20},
URN = {urn:nbn:de:0030-drops-144607},
doi = {10.4230/LIPIcs.MFCS.2021.20},
annote = {Keywords: deterministic omega-automata, learning from examples, learning in the limit, constructing acceptance conditions, active learning}
}
@InProceedings{bok_et_al:LIPIcs.MFCS.2021.21,
author = {Bok, Jan and Fiala, Ji\v{r}{\'\i} and Hlin\v{e}n\'{y}, Petr and Jedli\v{c}kov\'{a}, Nikola and Kratochv{\'\i}l, Jan},
title = {{Computational Complexity of Covering Multigraphs with Semi-Edges: Small Cases}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {21:1--21:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.21},
URN = {urn:nbn:de:0030-drops-144611},
doi = {10.4230/LIPIcs.MFCS.2021.21},
annote = {Keywords: graph cover, covering projection, semi-edges, multigraphs, complexity}
}
@InProceedings{branciard_et_al:LIPIcs.MFCS.2021.22,
author = {Branciard, Cyril and Cl\'{e}ment, Alexandre and Mhalla, Mehdi and Perdrix, Simon},
title = {{Coherent Control and Distinguishability of Quantum Channels via PBS-Diagrams}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {22:1--22:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.22},
URN = {urn:nbn:de:0030-drops-144629},
doi = {10.4230/LIPIcs.MFCS.2021.22},
annote = {Keywords: Quantum Computing, Diagrammatic Language, Quantum Control, Polarising Beam Splitter, Categorical Quantum Mechanics, Quantum Switch}
}
@InProceedings{brianski_et_al:LIPIcs.MFCS.2021.23,
author = {Bria\'{n}ski, Marcin and Felsner, Stefan and Hodor, J\k{e}drzej and Micek, Piotr},
title = {{Reconfiguring Independent Sets on Interval Graphs}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {23:1--23:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.23},
URN = {urn:nbn:de:0030-drops-144633},
doi = {10.4230/LIPIcs.MFCS.2021.23},
annote = {Keywords: reconfiguration, independent sets, interval graphs}
}
@InProceedings{bruse_et_al:LIPIcs.MFCS.2021.24,
author = {Bruse, Florian and S\"{a}lzer, Marco and Lange, Martin},
title = {{Finite Convergence of \mu-Calculus Fixpoints on Genuinely Infinite Structures}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {24:1--24:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.24},
URN = {urn:nbn:de:0030-drops-144643},
doi = {10.4230/LIPIcs.MFCS.2021.24},
annote = {Keywords: temporal logic, fixpoint iteration, bisimulation}
}
@InProceedings{buchin_et_al:LIPIcs.MFCS.2021.25,
author = {Buchin, Kevin and Hagedoorn, Mart and Kostitsyna, Irina and van Mulken, Max},
title = {{Dots \& Boxes Is PSPACE-Complete}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {25:1--25:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.25},
URN = {urn:nbn:de:0030-drops-144657},
doi = {10.4230/LIPIcs.MFCS.2021.25},
annote = {Keywords: Dots \& Boxes, PSPACE-complete, combinatorial game}
}
@InProceedings{buchin_et_al:LIPIcs.MFCS.2021.26,
author = {Buchin, Kevin and L\"{o}ffler, Maarten and Popov, Aleksandr and Roeloffzen, Marcel},
title = {{Uncertain Curve Simplification}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {26:1--26:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.26},
URN = {urn:nbn:de:0030-drops-144666},
doi = {10.4230/LIPIcs.MFCS.2021.26},
annote = {Keywords: Curves, Uncertainty, Simplification, Fr\'{e}chet Distance, Hausdorff Distance}
}
@InProceedings{butti_et_al:LIPIcs.MFCS.2021.27,
author = {Butti, Silvia and Dalmau, V{\'\i}ctor},
title = {{Fractional Homomorphism, Weisfeiler-Leman Invariance, and the Sherali-Adams Hierarchy for the Constraint Satisfaction Problem}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {27:1--27:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.27},
URN = {urn:nbn:de:0030-drops-144679},
doi = {10.4230/LIPIcs.MFCS.2021.27},
annote = {Keywords: Weisfeiler-Leman algorithm, Sherali-Adams hierarchy, Graph homomorphism, Constraint Satisfaction Problem}
}
@InProceedings{cesco_et_al:LIPIcs.MFCS.2021.28,
author = {Cesco, Arnaldo and Gorrieri, Roberto},
title = {{A Decidable Equivalence for a Turing-Complete, Distributed Model of Computation}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {28:1--28:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.28},
URN = {urn:nbn:de:0030-drops-144686},
doi = {10.4230/LIPIcs.MFCS.2021.28},
annote = {Keywords: Petri nets, Inhibitor arc, Behavioral equivalence, Bisimulation, Decidability}
}
@InProceedings{chapman_et_al:LIPIcs.MFCS.2021.29,
author = {Chapman, Brynmor K. and Williams, R. Ryan},
title = {{Black-Box Hypotheses and Lower Bounds}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {29:1--29:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.29},
URN = {urn:nbn:de:0030-drops-144698},
doi = {10.4230/LIPIcs.MFCS.2021.29},
annote = {Keywords: Black-Box hypothesis, circuit complexity, lower bounds}
}
@InProceedings{chardonnet_et_al:LIPIcs.MFCS.2021.30,
author = {Chardonnet, Kostia and Valiron, Beno\^{i}t and Vilmart, Renaud},
title = {{Geometry of Interaction for ZX-Diagrams}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {30:1--30:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.30},
URN = {urn:nbn:de:0030-drops-144701},
doi = {10.4230/LIPIcs.MFCS.2021.30},
annote = {Keywords: Quantum Computation, Linear Logic, ZX-Calculus, Geometry of Interaction}
}
@InProceedings{chaubal_et_al:LIPIcs.MFCS.2021.31,
author = {Chaubal, Siddhesh and G\'{a}l, Anna},
title = {{Diameter Versus Certificate Complexity of Boolean Functions}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {31:1--31:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.31},
URN = {urn:nbn:de:0030-drops-144713},
doi = {10.4230/LIPIcs.MFCS.2021.31},
annote = {Keywords: Sensitivity Conjecture, Boolean Functions, Certificate Complexity, Block Sensitivity, Log-rank Conjecture, Alternating Number}
}
@InProceedings{choudhary_et_al:LIPIcs.MFCS.2021.32,
author = {Choudhary, Keerti and Cohen, Avi and Narayanaswamy, N. S. and Peleg, David and Vijayaragunathan, R.},
title = {{Budgeted Dominating Sets in Uncertain Graphs}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {32:1--32:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.32},
URN = {urn:nbn:de:0030-drops-144723},
doi = {10.4230/LIPIcs.MFCS.2021.32},
annote = {Keywords: Uncertain graphs, Dominating set, NP-hard, PTAS, treewidth, planar graph}
}
@InProceedings{dcosta_et_al:LIPIcs.MFCS.2021.33,
author = {D'Costa, Julian and Lefaucheux, Engel and Neumann, Eike and Ouaknine, Jo\"{e}l and Worrell, James},
title = {{On the Complexity of the Escape Problem for Linear Dynamical Systems over Compact Semialgebraic Sets}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {33:1--33:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.33},
URN = {urn:nbn:de:0030-drops-144734},
doi = {10.4230/LIPIcs.MFCS.2021.33},
annote = {Keywords: Discrete linear dynamical systems, Program termination, Compact semialgebraic sets, Theory of the reals}
}
@InProceedings{dcosta_et_al:LIPIcs.MFCS.2021.34,
author = {D'Costa, Julian and Karimov, Toghrul and Majumdar, Rupak and Ouaknine, Jo\"{e}l and Salamati, Mahmoud and Soudjani, Sadegh and Worrell, James},
title = {{The Pseudo-Skolem Problem is Decidable}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {34:1--34:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.34},
URN = {urn:nbn:de:0030-drops-144742},
doi = {10.4230/LIPIcs.MFCS.2021.34},
annote = {Keywords: Pseudo-orbits, Orbit problem, Skolem problem, linear dynamical systems}
}
@InProceedings{dallago_et_al:LIPIcs.MFCS.2021.35,
author = {Dal Lago, Ugo and Kahle, Reinhard and Oitavem, Isabel},
title = {{A Recursion-Theoretic Characterization of the Probabilistic Class PP}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {35:1--35:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.35},
URN = {urn:nbn:de:0030-drops-144754},
doi = {10.4230/LIPIcs.MFCS.2021.35},
annote = {Keywords: Implicit complexity, tree-recursion, probabilistic classes, polynomial time, PP}
}
@InProceedings{datta_et_al:LIPIcs.MFCS.2021.36,
author = {Datta, Samir and Jaiswal, Kishlaya},
title = {{Parallel Polynomial Permanent Mod Powers of 2 and Shortest Disjoint Cycles}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {36:1--36:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.36},
URN = {urn:nbn:de:0030-drops-144763},
doi = {10.4230/LIPIcs.MFCS.2021.36},
annote = {Keywords: permanent mod powers of 2, parallel computation, graphs, shortest disjoint paths, shortest disjoint cycles}
}
@InProceedings{dawar_et_al:LIPIcs.MFCS.2021.37,
author = {Dawar, Anuj and Vagnozzi, Danny},
title = {{On the Relative Power of Linear Algebraic Approximations of Graph Isomorphism}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {37:1--37:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.37},
URN = {urn:nbn:de:0030-drops-144774},
doi = {10.4230/LIPIcs.MFCS.2021.37},
annote = {Keywords: Graph isomorphism, proof complexity, invertible map tests}
}
@InProceedings{defigueiredo_et_al:LIPIcs.MFCS.2021.38,
author = {de Figueiredo, Celina M. H. and de Melo, Alexsander A. and Oliveira, Fabiano S. and Silva, Ana},
title = {{Maximum Cut on Interval Graphs of Interval Count Four Is NP-Complete}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {38:1--38:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.38},
URN = {urn:nbn:de:0030-drops-144781},
doi = {10.4230/LIPIcs.MFCS.2021.38},
annote = {Keywords: maximum cut, interval graphs, interval lengths, interval count, NP-complete}
}
@InProceedings{deppert_et_al:LIPIcs.MFCS.2021.39,
author = {Deppert, Max A. and Jansen, Klaus and Klein, Kim-Manuel},
title = {{Fuzzy Simultaneous Congruences}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {39:1--39:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.39},
URN = {urn:nbn:de:0030-drops-144792},
doi = {10.4230/LIPIcs.MFCS.2021.39},
annote = {Keywords: Simultaneous congruences, Integer programming, Mixing Set, Real-time scheduling, Diophantine approximation}
}
@InProceedings{doueneautabot:LIPIcs.MFCS.2021.40,
author = {Dou\'{e}neau-Tabot, Ga\"{e}tan},
title = {{Pebble Transducers with Unary Output}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {40:1--40:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.40},
URN = {urn:nbn:de:0030-drops-144805},
doi = {10.4230/LIPIcs.MFCS.2021.40},
annote = {Keywords: polyregular functions, pebble transducers, marble transducers, streaming string transducers, factorization forests}
}
@InProceedings{doumane:LIPIcs.MFCS.2021.41,
author = {Doumane, Amina},
title = {{Graph Characterization of the Universal Theory of Relations}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {41:1--41:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.41},
URN = {urn:nbn:de:0030-drops-144815},
doi = {10.4230/LIPIcs.MFCS.2021.41},
annote = {Keywords: Relation algebra, Graph homomorphism, Equational theories, First-order logic}
}
@InProceedings{duarte_et_al:LIPIcs.MFCS.2021.42,
author = {Duarte, Gabriel L. and de Oliveira Oliveira, Mateus and Souza, U\'{e}verton S.},
title = {{Co-Degeneracy and Co-Treewidth: Using the Complement to Solve Dense Instances}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {42:1--42:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.42},
URN = {urn:nbn:de:0030-drops-144828},
doi = {10.4230/LIPIcs.MFCS.2021.42},
annote = {Keywords: FPT, treewidth, degeneracy, complement graph, Bondy-Chv\'{a}tal closure}
}
@InProceedings{ducoffe:LIPIcs.MFCS.2021.43,
author = {Ducoffe, Guillaume},
title = {{Isometric Embeddings in Trees and Their Use in Distance Problems}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {43:1--43:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.43},
URN = {urn:nbn:de:0030-drops-144835},
doi = {10.4230/LIPIcs.MFCS.2021.43},
annote = {Keywords: Tree embeddings, Range queries, Centroid decomposition, Heavy-path decomposition, Diameter, Radius and all Eccentricities computations}
}
@InProceedings{ducoffe:LIPIcs.MFCS.2021.44,
author = {Ducoffe, Guillaume},
title = {{On Computing the Average Distance for Some Chordal-Like Graphs}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {44:1--44:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.44},
URN = {urn:nbn:de:0030-drops-144841},
doi = {10.4230/LIPIcs.MFCS.2021.44},
annote = {Keywords: Wiener index, Graph diameter, Hardness in P, Chordal graphs, Helly graphs}
}
@InProceedings{dumas_et_al:LIPIcs.MFCS.2021.45,
author = {Dumas, Ma\"{e}l and Perez, Anthony and Todinca, Ioan},
title = {{A Cubic Vertex-Kernel for Trivially Perfect Editing}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {45:1--45:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.45},
URN = {urn:nbn:de:0030-drops-144851},
doi = {10.4230/LIPIcs.MFCS.2021.45},
annote = {Keywords: Parameterized complexity, kernelization algorithms, graph modification, trivially perfect graphs}
}
@InProceedings{ferens_et_al:LIPIcs.MFCS.2021.46,
author = {Ferens, Robert and Szyku{\l}a, Marek and Vorel, Vojt\v{e}ch},
title = {{Lower Bounds on Avoiding Thresholds}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {46:1--46:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.46},
URN = {urn:nbn:de:0030-drops-144869},
doi = {10.4230/LIPIcs.MFCS.2021.46},
annote = {Keywords: avoiding word, \v{C}ern\'{y} conjecture, rank conjecture, reset threshold, reset word, synchronizing automaton, synchronizing word}
}
@InProceedings{fortin_et_al:LIPIcs.MFCS.2021.47,
author = {Fortin, Marie and Kuijer, Louwe B. and Totzke, Patrick and Zimmermann, Martin},
title = {{HyperLTL Satisfiability Is \Sigma₁¹-Complete, HyperCTL* Satisfiability Is \Sigma₁²-Complete}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {47:1--47:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.47},
URN = {urn:nbn:de:0030-drops-144870},
doi = {10.4230/LIPIcs.MFCS.2021.47},
annote = {Keywords: HyperLTL, HyperCTL*, Satisfiability, Analytical Hierarchy}
}
@InProceedings{gawrychowski_et_al:LIPIcs.MFCS.2021.48,
author = {Gawrychowski, Pawe{\l} and Manea, Florin and Siemer, Stefan},
title = {{Matching Patterns with Variables Under Hamming Distance}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {48:1--48:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.48},
URN = {urn:nbn:de:0030-drops-144886},
doi = {10.4230/LIPIcs.MFCS.2021.48},
annote = {Keywords: Pattern with variables, Matching algorithms, Hamming distance, Conditional lower bounds, Patterns with structural restrictions}
}
@InProceedings{geran_et_al:LIPIcs.MFCS.2021.49,
author = {G\'{e}ran, Yoan and Laboureix, Bastien and Mascle, Corto and Richard, Valentin D.},
title = {{Keyboards as a New Model of Computation}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {49:1--49:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.49},
URN = {urn:nbn:de:0030-drops-144896},
doi = {10.4230/LIPIcs.MFCS.2021.49},
annote = {Keywords: formal languages, models of computation, automata theory}
}
@InProceedings{glos_et_al:LIPIcs.MFCS.2021.50,
author = {Glos, Adam and Kokainis, Martins and Mori, Ryuhei and Vihrovs, Jevg\={e}nijs},
title = {{Quantum Speedups for Dynamic Programming on n-Dimensional Lattice Graphs}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {50:1--50:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.50},
URN = {urn:nbn:de:0030-drops-144901},
doi = {10.4230/LIPIcs.MFCS.2021.50},
annote = {Keywords: Quantum query complexity, Dynamic programming, Lattice graphs}
}
@InProceedings{grosshans:LIPIcs.MFCS.2021.51,
author = {Grosshans, Nathan},
title = {{A Note on the Join of Varieties of Monoids with LI}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {51:1--51:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.51},
URN = {urn:nbn:de:0030-drops-144918},
doi = {10.4230/LIPIcs.MFCS.2021.51},
annote = {Keywords: Varieties of monoids, join, LI}
}
@InProceedings{gruber_et_al:LIPIcs.MFCS.2021.52,
author = {Gruber, Hermann and Holzer, Markus},
title = {{Optimal Regular Expressions for Palindromes of Given Length}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {52:1--52:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.52},
URN = {urn:nbn:de:0030-drops-144921},
doi = {10.4230/LIPIcs.MFCS.2021.52},
annote = {Keywords: regular expression, descriptional complexity, lower bound, upper bound, recurrence, sum of digits}
}
@InProceedings{guha_et_al:LIPIcs.MFCS.2021.53,
author = {Guha, Shibashis and Jecker, Isma\"{e}l and Lehtinen, Karoliina and Zimmermann, Martin},
title = {{A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {53:1--53:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.53},
URN = {urn:nbn:de:0030-drops-144932},
doi = {10.4230/LIPIcs.MFCS.2021.53},
annote = {Keywords: Pushdown Automata, Good-for-games, Synthesis, Succintness}
}
@InProceedings{gutin_et_al:LIPIcs.MFCS.2021.54,
author = {Gutin, Gregory and Yeo, Anders},
title = {{Perfect Forests in Graphs and Their Extensions}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {54:1--54:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.54},
URN = {urn:nbn:de:0030-drops-144947},
doi = {10.4230/LIPIcs.MFCS.2021.54},
annote = {Keywords: graphs, odd degree subgraphs, perfect forests, polynomial algorithms}
}
@InProceedings{haase_et_al:LIPIcs.MFCS.2021.55,
author = {Haase, Christoph and Mansutti, Alessio},
title = {{On Deciding Linear Arithmetic Constraints Over p-adic Integers for All Primes}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {55:1--55:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.55},
URN = {urn:nbn:de:0030-drops-144953},
doi = {10.4230/LIPIcs.MFCS.2021.55},
annote = {Keywords: linear arithmetic, B\"{u}chi arithmetic, p-adic numbers, automatic structures}
}
@InProceedings{haghighatkhah_et_al:LIPIcs.MFCS.2021.56,
author = {Haghighatkhah, Pantea and Meulemans, Wouter and Speckmann, Bettina and Urhausen, J\'{e}r\^{o}me and Verbeek, Kevin},
title = {{Obstructing Classification via Projection}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {56:1--56:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.56},
URN = {urn:nbn:de:0030-drops-144965},
doi = {10.4230/LIPIcs.MFCS.2021.56},
annote = {Keywords: Projection, classification, models of learning}
}
@InProceedings{harutyunyan_et_al:LIPIcs.MFCS.2021.57,
author = {Harutyunyan, Hovhannes A. and Pankratov, Denis and Racicot, Jesse},
title = {{Online Domination: The Value of Getting to Know All Your Neighbors}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {57:1--57:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.57},
URN = {urn:nbn:de:0030-drops-144979},
doi = {10.4230/LIPIcs.MFCS.2021.57},
annote = {Keywords: Dominating set, online algorithms, competitive ratio, trees, cactus graphs, bipartite planar graphs, series-parallel graphs, closed neighborhood}
}
@InProceedings{hausmann_et_al:LIPIcs.MFCS.2021.58,
author = {Hausmann, Daniel and Milius, Stefan and Schr\"{o}der, Lutz},
title = {{A Linear-Time Nominal \mu-Calculus with Name Allocation}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {58:1--58:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.58},
URN = {urn:nbn:de:0030-drops-144987},
doi = {10.4230/LIPIcs.MFCS.2021.58},
annote = {Keywords: Model checking, linear-time logic, nominal sets}
}
@InProceedings{hirahara_et_al:LIPIcs.MFCS.2021.59,
author = {Hirahara, Shuichi and Le Gall, Fran\c{c}ois},
title = {{Test of Quantumness with Small-Depth Quantum Circuits}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {59:1--59:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.59},
URN = {urn:nbn:de:0030-drops-144996},
doi = {10.4230/LIPIcs.MFCS.2021.59},
annote = {Keywords: Quantum computing, small-depth circuits, quantum cryptography}
}
@InProceedings{hubacek_et_al:LIPIcs.MFCS.2021.60,
author = {Hub\'{a}\v{c}ek, Pavel and V\'{a}clavek, Jan},
title = {{On Search Complexity of Discrete Logarithm}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {60:1--60:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.60},
URN = {urn:nbn:de:0030-drops-145006},
doi = {10.4230/LIPIcs.MFCS.2021.60},
annote = {Keywords: discrete logarithm, total search problems, completeness, TFNP, PPP, PWPP}
}
@InProceedings{ikebuchi:LIPIcs.MFCS.2021.61,
author = {Ikebuchi, Mirai},
title = {{A Homological Condition on Equational Unifiability}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {61:1--61:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.61},
URN = {urn:nbn:de:0030-drops-145010},
doi = {10.4230/LIPIcs.MFCS.2021.61},
annote = {Keywords: Equational unification, Homological algebra, equational theories}
}
@InProceedings{jaakkola:LIPIcs.MFCS.2021.62,
author = {Jaakkola, Reijo},
title = {{Ordered Fragments of First-Order Logic}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {62:1--62:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.62},
URN = {urn:nbn:de:0030-drops-145025},
doi = {10.4230/LIPIcs.MFCS.2021.62},
annote = {Keywords: ordered logic, fluted logic, complexity, decidability}
}
@InProceedings{jancar_et_al:LIPIcs.MFCS.2021.63,
author = {Jan\v{c}ar, Petr and \v{S}{\'\i}ma, Ji\v{r}{\'\i}},
title = {{The Simplest Non-Regular Deterministic Context-Free Language}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {63:1--63:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.63},
URN = {urn:nbn:de:0030-drops-145037},
doi = {10.4230/LIPIcs.MFCS.2021.63},
annote = {Keywords: deterministic context-free language, truth-table reduction, Mealy automaton, pushdown automaton}
}
@InProceedings{jansen_et_al:LIPIcs.MFCS.2021.64,
author = {Jansen, Bart M. P. and Roy, Shivesh K. and W{\l}odarczyk, Micha{\l}},
title = {{On the Hardness of Compressing Weights}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {64:1--64:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.64},
URN = {urn:nbn:de:0030-drops-145049},
doi = {10.4230/LIPIcs.MFCS.2021.64},
annote = {Keywords: kernelization, compression, edge-weighted clique, constraint satisfaction problems}
}
@InProceedings{jelinek_et_al:LIPIcs.MFCS.2021.65,
author = {Jel{\'\i}nek, V{\'\i}t and Opler, Michal and Pek\'{a}rek, Jakub},
title = {{Griddings of Permutations and Hardness of Pattern Matching}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {65:1--65:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.65},
URN = {urn:nbn:de:0030-drops-145050},
doi = {10.4230/LIPIcs.MFCS.2021.65},
annote = {Keywords: Permutation, pattern matching, NP-hardness}
}
@InProceedings{kaminski_et_al:LIPIcs.MFCS.2021.66,
author = {Kaminski, Michael and Shparlinski, Igor E.},
title = {{Sets of Linear Forms Which Are Hard to Compute}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {66:1--66:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.66},
URN = {urn:nbn:de:0030-drops-145065},
doi = {10.4230/LIPIcs.MFCS.2021.66},
annote = {Keywords: Linear algorithms, additive complexity, effective Perron theorem, effective Lindemann-Weierstrass theorem}
}
@InProceedings{kenison_et_al:LIPIcs.MFCS.2021.67,
author = {Kenison, George and Klurman, Oleksiy and Lefaucheux, Engel and Luca, Florian and Moree, Pieter and Ouaknine, Jo\"{e}l and Whiteland, Markus A. and Worrell, James},
title = {{On Positivity and Minimality for Second-Order Holonomic Sequences}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {67:1--67:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.67},
URN = {urn:nbn:de:0030-drops-145071},
doi = {10.4230/LIPIcs.MFCS.2021.67},
annote = {Keywords: Holonomic sequences, Minimal solutions, Positivity Problem}
}
@InProceedings{kivva:LIPIcs.MFCS.2021.68,
author = {Kivva, Bohdan},
title = {{Improved Upper Bounds for the Rigidity of Kronecker Products}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {68:1--68:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.68},
URN = {urn:nbn:de:0030-drops-145081},
doi = {10.4230/LIPIcs.MFCS.2021.68},
annote = {Keywords: Matrix rigidity, Kronecker product, Hadamard matrices}
}
@InProceedings{klauck_et_al:LIPIcs.MFCS.2021.69,
author = {Klauck, Hartmut and Lim, Debbie},
title = {{The Power of One Clean Qubit in Communication Complexity}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {69:1--69:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.69},
URN = {urn:nbn:de:0030-drops-145097},
doi = {10.4230/LIPIcs.MFCS.2021.69},
annote = {Keywords: Quantum Complexity Theory, Quantum Communication Complexity, One Clean Qubit Model}
}
@InProceedings{kraus_et_al:LIPIcs.MFCS.2021.70,
author = {Kraus, Nicolai and Nordvall Forsberg, Fredrik and Xu, Chuangjie},
title = {{Connecting Constructive Notions of Ordinals in Homotopy Type Theory}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {70:1--70:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.70},
URN = {urn:nbn:de:0030-drops-145100},
doi = {10.4230/LIPIcs.MFCS.2021.70},
annote = {Keywords: Constructive ordinals, Cantor normal forms, Brouwer trees}
}
@InProceedings{li_et_al:LIPIcs.MFCS.2021.71,
author = {Li, Fu and Zheng, Xiong},
title = {{Maximum Votes Pareto-Efficient Allocations via Swaps on a Social Network}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {71:1--71:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.71},
URN = {urn:nbn:de:0030-drops-145112},
doi = {10.4230/LIPIcs.MFCS.2021.71},
annote = {Keywords: Housing markets, Distributed process, Algorithms, Complexity}
}
@InProceedings{linker_et_al:LIPIcs.MFCS.2021.72,
author = {Linker, Sven and Papacchini, Fabio and Sevegnani, Michele},
title = {{Finite Models for a Spatial Logic with Discrete and Topological Path Operators}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {72:1--72:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.72},
URN = {urn:nbn:de:0030-drops-145120},
doi = {10.4230/LIPIcs.MFCS.2021.72},
annote = {Keywords: spatial logic, topology, finite models}
}
@InProceedings{mahlmann_et_al:LIPIcs.MFCS.2021.73,
author = {M\"{a}hlmann, Nikolas and Siebertz, Sebastian and Vigny, Alexandre},
title = {{Recursive Backdoors for SAT}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {73:1--73:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.73},
URN = {urn:nbn:de:0030-drops-145138},
doi = {10.4230/LIPIcs.MFCS.2021.73},
annote = {Keywords: Propositional satisfiability SAT, Backdoors, Parameterized Algorithms}
}
@InProceedings{mattes_et_al:LIPIcs.MFCS.2021.74,
author = {Mattes, Caroline and Wei{\ss}, Armin},
title = {{Parallel Algorithms for Power Circuits and the Word Problem of the Baumslag Group}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {74:1--74:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.74},
URN = {urn:nbn:de:0030-drops-145148},
doi = {10.4230/LIPIcs.MFCS.2021.74},
annote = {Keywords: Word problem, Baumslag group, power circuit, parallel complexity}
}
@InProceedings{mertzios_et_al:LIPIcs.MFCS.2021.75,
author = {Mertzios, George B. and Molter, Hendrik and Renken, Malte and Spirakis, Paul G. and Zschoche, Philipp},
title = {{The Complexity of Transitively Orienting Temporal Graphs}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {75:1--75:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.75},
URN = {urn:nbn:de:0030-drops-145157},
doi = {10.4230/LIPIcs.MFCS.2021.75},
annote = {Keywords: Temporal graph, transitive orientation, transitive closure, polynomial-time algorithm, NP-hardness, satisfiability}
}
@InProceedings{molter_et_al:LIPIcs.MFCS.2021.76,
author = {Molter, Hendrik and Renken, Malte and Zschoche, Philipp},
title = {{Temporal Reachability Minimization: Delaying vs. Deleting}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {76:1--76:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.76},
URN = {urn:nbn:de:0030-drops-145161},
doi = {10.4230/LIPIcs.MFCS.2021.76},
annote = {Keywords: Temporal Graphs, Temporal Paths, Disease Spreading, Network Flows, Parameterized Algorithms, NP-hard Problems}
}
@InProceedings{morawietz_et_al:LIPIcs.MFCS.2021.77,
author = {Morawietz, Nils and Wolf, Petra},
title = {{A Timecop’s Chase Around the Table}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {77:1--77:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.77},
URN = {urn:nbn:de:0030-drops-145176},
doi = {10.4230/LIPIcs.MFCS.2021.77},
annote = {Keywords: Time variable graph, Edge periodic cycle, Game of cops and robbers, Computational complexity}
}
@InProceedings{myers_et_al:LIPIcs.MFCS.2021.78,
author = {Myers, Robert S. R. and Urbat, Henning},
title = {{Syntactic Minimization Of Nondeterministic Finite Automata}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {78:1--78:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.78},
URN = {urn:nbn:de:0030-drops-145186},
doi = {10.4230/LIPIcs.MFCS.2021.78},
annote = {Keywords: Algebraic language theory, Nondeterministic automata, NP-completeness}
}
@InProceedings{nakano:LIPIcs.MFCS.2021.79,
author = {Nakano, Keisuke},
title = {{Idempotent Turing Machines}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {79:1--79:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.79},
URN = {urn:nbn:de:0030-drops-145191},
doi = {10.4230/LIPIcs.MFCS.2021.79},
annote = {Keywords: Turing machines, Idempotent functions, Computable functions, Computation model}
}
@InProceedings{nandakumar_et_al:LIPIcs.MFCS.2021.80,
author = {Nandakumar, Satyadev and Pulari, Subin},
title = {{Ergodic Theorems and Converses for PSPACE Functions}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {80:1--80:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.80},
URN = {urn:nbn:de:0030-drops-145204},
doi = {10.4230/LIPIcs.MFCS.2021.80},
annote = {Keywords: Ergodic Theorem, Resource-bounded randomness, Computable analysis, Complexity theory}
}
@InProceedings{niwinski_et_al:LIPIcs.MFCS.2021.81,
author = {Niwi\'{n}ski, Damian and Skrzypczak, Micha{\l}},
title = {{On Guidable Index of Tree Automata}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {81:1--81:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.81},
URN = {urn:nbn:de:0030-drops-145214},
doi = {10.4230/LIPIcs.MFCS.2021.81},
annote = {Keywords: guidable automata, index problem, \omega-regular games}
}
@InProceedings{paesani_et_al:LIPIcs.MFCS.2021.82,
author = {Paesani, Giacomo and Paulusma, Dani\"{e}l and Rz\k{a}\.{z}ewski, Pawe{\l}},
title = {{Feedback Vertex Set and Even Cycle Transversal for H-Free Graphs: Finding Large Block Graphs}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {82:1--82:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.82},
URN = {urn:nbn:de:0030-drops-145224},
doi = {10.4230/LIPIcs.MFCS.2021.82},
annote = {Keywords: Feedback vertex set, even cycle transversal, odd cactus, forest, block}
}
@InProceedings{papp_et_al:LIPIcs.MFCS.2021.83,
author = {Papp, P\'{a}l Andr\'{a}s and Wattenhofer, Roger},
title = {{Stabilization Bounds for Influence Propagation from a Random Initial State}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {83:1--83:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.83},
URN = {urn:nbn:de:0030-drops-145239},
doi = {10.4230/LIPIcs.MFCS.2021.83},
annote = {Keywords: Majority process, Minority process, Stabilization time, Random initialization, Asynchronous model}
}
@InProceedings{peyerimhoff_et_al:LIPIcs.MFCS.2021.84,
author = {Peyerimhoff, Norbert and Roth, Marc and Schmitt, Johannes and Stix, Jakob and Vdovina, Alina},
title = {{Parameterized (Modular) Counting and Cayley Graph Expanders}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {84:1--84:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.84},
URN = {urn:nbn:de:0030-drops-145246},
doi = {10.4230/LIPIcs.MFCS.2021.84},
annote = {Keywords: Cayley graphs, counting complexity, expander graphs, fine-grained complexity, parameterized complexity}
}
@InProceedings{aburadi_et_al:LIPIcs.MFCS.2021.85,
author = {Abu Radi, Bader and Kupferman, Orna and Leshkowitz, Ofer},
title = {{A Hierarchy of Nondeterminism}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {85:1--85:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.85},
URN = {urn:nbn:de:0030-drops-145254},
doi = {10.4230/LIPIcs.MFCS.2021.85},
annote = {Keywords: Automata on Infinite Words, Expressive power, Complexity, Games}
}
@InProceedings{tamm:LIPIcs.MFCS.2021.86,
author = {Tamm, Hellis},
title = {{Boolean Automata and Atoms of Regular Languages}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {86:1--86:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.86},
URN = {urn:nbn:de:0030-drops-145267},
doi = {10.4230/LIPIcs.MFCS.2021.86},
annote = {Keywords: Boolean automaton, Regular language, Atoms}
}
@InProceedings{trotta_et_al:LIPIcs.MFCS.2021.87,
author = {Trotta, Davide and Spadetto, Matteo and de Paiva, Valeria},
title = {{The G\"{o}del Fibration}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {87:1--87:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.87},
URN = {urn:nbn:de:0030-drops-145272},
doi = {10.4230/LIPIcs.MFCS.2021.87},
annote = {Keywords: Dialectica category, G\"{o}del fibration, Pseudo-monad}
}
@InProceedings{tsampas_et_al:LIPIcs.MFCS.2021.88,
author = {Tsampas, Stelios and Williams, Christian and Nuyts, Andreas and Devriese, Dominique and Piessens, Frank},
title = {{Abstract Congruence Criteria for Weak Bisimilarity}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {88:1--88:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.88},
URN = {urn:nbn:de:0030-drops-145281},
doi = {10.4230/LIPIcs.MFCS.2021.88},
annote = {Keywords: Structural Operational Semantics, distributive laws, weak bisimilarity}
}
@InProceedings{vilmart:LIPIcs.MFCS.2021.89,
author = {Vilmart, Renaud},
title = {{Quantum Multiple-Valued Decision Diagrams in Graphical Calculi}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {89:1--89:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.89},
URN = {urn:nbn:de:0030-drops-145295},
doi = {10.4230/LIPIcs.MFCS.2021.89},
annote = {Keywords: Quantum Computing, ZH-Calculus, Decision Diagrams}
}
@InProceedings{winter:LIPIcs.MFCS.2021.90,
author = {Winter, Sarah},
title = {{Decision Problems for Origin-Close Top-Down Tree Transducers}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {90:1--90:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.90},
URN = {urn:nbn:de:0030-drops-145308},
doi = {10.4230/LIPIcs.MFCS.2021.90},
annote = {Keywords: tree tranducers, equivalence, uniformization, synthesis, origin semantics}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing