44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 323, pp. 1-670, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@Proceedings{barman_et_al:LIPIcs.FSTTCS.2024, title = {{LIPIcs, Volume 323, FSTTCS 2024, Complete Volume}}, booktitle = {44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024)}, pages = {1--670}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-355-3}, ISSN = {1868-8969}, year = {2024}, volume = {323}, editor = {Barman, Siddharth and Lasota, S{\l}awomir}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2024}, URN = {urn:nbn:de:0030-drops-225763}, doi = {10.4230/LIPIcs.FSTTCS.2024}, annote = {Keywords: LIPIcs, Volume 323, FSTTCS 2024, Complete Volume} }
44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 323, pp. 0:i-0:xviii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{barman_et_al:LIPIcs.FSTTCS.2024.0, author = {Barman, Siddharth and Lasota, S{\l}awomir}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024)}, pages = {0:i--0:xviii}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-355-3}, ISSN = {1868-8969}, year = {2024}, volume = {323}, editor = {Barman, Siddharth and Lasota, S{\l}awomir}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2024.0}, URN = {urn:nbn:de:0030-drops-225754}, doi = {10.4230/LIPIcs.FSTTCS.2024.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Dmitry Chistikov. An Introduction to the Theory of Linear Integer Arithmetic (Invited Paper). In 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 323, pp. 1:1-1:36, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{chistikov:LIPIcs.FSTTCS.2024.1, author = {Chistikov, Dmitry}, title = {{An Introduction to the Theory of Linear Integer Arithmetic}}, booktitle = {44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024)}, pages = {1:1--1:36}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-355-3}, ISSN = {1868-8969}, year = {2024}, volume = {323}, editor = {Barman, Siddharth and Lasota, S{\l}awomir}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2024.1}, URN = {urn:nbn:de:0030-drops-221909}, doi = {10.4230/LIPIcs.FSTTCS.2024.1}, annote = {Keywords: Logical theories of arithmetic, decision procedures} }
Sebastian Siebertz and Alexandre Vigny. Advances in Algorithmic Meta Theorems (Invited Paper). In 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 323, pp. 2:1-2:29, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{siebertz_et_al:LIPIcs.FSTTCS.2024.2, author = {Siebertz, Sebastian and Vigny, Alexandre}, title = {{Advances in Algorithmic Meta Theorems}}, booktitle = {44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024)}, pages = {2:1--2:29}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-355-3}, ISSN = {1868-8969}, year = {2024}, volume = {323}, editor = {Barman, Siddharth and Lasota, S{\l}awomir}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2024.2}, URN = {urn:nbn:de:0030-drops-221912}, doi = {10.4230/LIPIcs.FSTTCS.2024.2}, annote = {Keywords: Algorithmic meta theorems, monadic second-order logic, first-order logic, disjoint paths logic, algorithmic graph structure theory} }
Étienne André, Johan Arcile, and Engel Lefaucheux. Execution-Time Opacity Problems in One-Clock Parametric Timed Automata. In 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 323, pp. 3:1-3:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{andre_et_al:LIPIcs.FSTTCS.2024.3, author = {Andr\'{e}, \'{E}tienne and Arcile, Johan and Lefaucheux, Engel}, title = {{Execution-Time Opacity Problems in One-Clock Parametric Timed Automata}}, booktitle = {44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024)}, pages = {3:1--3:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-355-3}, ISSN = {1868-8969}, year = {2024}, volume = {323}, editor = {Barman, Siddharth and Lasota, S{\l}awomir}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2024.3}, URN = {urn:nbn:de:0030-drops-221923}, doi = {10.4230/LIPIcs.FSTTCS.2024.3}, annote = {Keywords: Timed opacity, Parametric timed automata, Presburger arithmetic} }
V. Arvind, Samir Datta, Asif Khan, Shivdutt Sharma, Yadu Vasudev, and Shankar Ram Vasudevan. The Parallel Dynamic Complexity of the Abelian Cayley Group Membership Problem. In 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 323, pp. 4:1-4:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{arvind_et_al:LIPIcs.FSTTCS.2024.4, author = {Arvind, V. and Datta, Samir and Khan, Asif and Sharma, Shivdutt and Vasudev, Yadu and Vasudevan, Shankar Ram}, title = {{The Parallel Dynamic Complexity of the Abelian Cayley Group Membership Problem}}, booktitle = {44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024)}, pages = {4:1--4:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-355-3}, ISSN = {1868-8969}, year = {2024}, volume = {323}, editor = {Barman, Siddharth and Lasota, S{\l}awomir}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2024.4}, URN = {urn:nbn:de:0030-drops-221939}, doi = {10.4230/LIPIcs.FSTTCS.2024.4}, annote = {Keywords: Dynamic Complexity, Group Theory, Cayley Group Membership, Abelian Group Isomorphism} }
Ali Asadi, Krishnendu Chatterjee, Raimundo Saona, and Jakub Svoboda. Concurrent Stochastic Games with Stateful-Discounted and Parity Objectives: Complexity and Algorithms. In 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 323, pp. 5:1-5:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{asadi_et_al:LIPIcs.FSTTCS.2024.5, author = {Asadi, Ali and Chatterjee, Krishnendu and Saona, Raimundo and Svoboda, Jakub}, title = {{Concurrent Stochastic Games with Stateful-Discounted and Parity Objectives: Complexity and Algorithms}}, booktitle = {44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024)}, pages = {5:1--5:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-355-3}, ISSN = {1868-8969}, year = {2024}, volume = {323}, editor = {Barman, Siddharth and Lasota, S{\l}awomir}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2024.5}, URN = {urn:nbn:de:0030-drops-221942}, doi = {10.4230/LIPIcs.FSTTCS.2024.5}, annote = {Keywords: Concurrent Stochastic Games, Parity Objectives, Discounted-sum Objectives} }
Nikhil Ayyadevara, Ashish Chiplunkar, and Amatya Sharma. A Decomposition Approach to the Weighted k-Server Problem. In 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 323, pp. 6:1-6:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{ayyadevara_et_al:LIPIcs.FSTTCS.2024.6, author = {Ayyadevara, Nikhil and Chiplunkar, Ashish and Sharma, Amatya}, title = {{A Decomposition Approach to the Weighted k-Server Problem}}, booktitle = {44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024)}, pages = {6:1--6:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-355-3}, ISSN = {1868-8969}, year = {2024}, volume = {323}, editor = {Barman, Siddharth and Lasota, S{\l}awomir}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2024.6}, URN = {urn:nbn:de:0030-drops-221954}, doi = {10.4230/LIPIcs.FSTTCS.2024.6}, annote = {Keywords: Online Algorithms, k-server, paging} }
Aritra Banik, Sayani Das, Anil Maheshwari, Bubai Manna, Subhas C. Nandy, Krishna Priya K. M., Bodhayan Roy, Sasanka Roy, and Abhishek Sahu. Minimum Consistent Subset in Trees and Interval Graphs. In 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 323, pp. 7:1-7:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{banik_et_al:LIPIcs.FSTTCS.2024.7, author = {Banik, Aritra and Das, Sayani and Maheshwari, Anil and Manna, Bubai and Nandy, Subhas C. and Priya K. M., Krishna and Roy, Bodhayan and Roy, Sasanka and Sahu, Abhishek}, title = {{Minimum Consistent Subset in Trees and Interval Graphs}}, booktitle = {44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024)}, pages = {7:1--7:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-355-3}, ISSN = {1868-8969}, year = {2024}, volume = {323}, editor = {Barman, Siddharth and Lasota, S{\l}awomir}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2024.7}, URN = {urn:nbn:de:0030-drops-221960}, doi = {10.4230/LIPIcs.FSTTCS.2024.7}, annote = {Keywords: Nearest-Neighbor Classification, Minimum Consistent Subset, Trees, Interval Graphs, Parameterized complexity, NP-complete} }
Benoît Barbot, Patricia Bouyer, and Serge Haddad. Beyond Decisiveness of Infinite Markov Chains. In 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 323, pp. 8:1-8:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{barbot_et_al:LIPIcs.FSTTCS.2024.8, author = {Barbot, Beno\^{i}t and Bouyer, Patricia and Haddad, Serge}, title = {{Beyond Decisiveness of Infinite Markov Chains}}, booktitle = {44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024)}, pages = {8:1--8:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-355-3}, ISSN = {1868-8969}, year = {2024}, volume = {323}, editor = {Barman, Siddharth and Lasota, S{\l}awomir}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2024.8}, URN = {urn:nbn:de:0030-drops-221977}, doi = {10.4230/LIPIcs.FSTTCS.2024.8}, annote = {Keywords: Markov Chains, Infinite State Systems, Numerical and Statistical Verification} }
Dylan Bellier, Massimo Benerecetti, Fabio Mogavero, and Sophie Pinchinat. Plan Logic. In 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 323, pp. 9:1-9:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{bellier_et_al:LIPIcs.FSTTCS.2024.9, author = {Bellier, Dylan and Benerecetti, Massimo and Mogavero, Fabio and Pinchinat, Sophie}, title = {{Plan Logic}}, booktitle = {44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024)}, pages = {9:1--9:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-355-3}, ISSN = {1868-8969}, year = {2024}, volume = {323}, editor = {Barman, Siddharth and Lasota, S{\l}awomir}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2024.9}, URN = {urn:nbn:de:0030-drops-221988}, doi = {10.4230/LIPIcs.FSTTCS.2024.9}, annote = {Keywords: Logic for strategic reasoning, Strategy Logic, Realisable strategies, Strategies vs. plans, Hyperteam semantics} }
Vishwas Bhargava and Anamay Tengse. Explicit Commutative ROABPs from Partial Derivatives. In 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 323, pp. 10:1-10:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{bhargava_et_al:LIPIcs.FSTTCS.2024.10, author = {Bhargava, Vishwas and Tengse, Anamay}, title = {{Explicit Commutative ROABPs from Partial Derivatives}}, booktitle = {44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024)}, pages = {10:1--10:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-355-3}, ISSN = {1868-8969}, year = {2024}, volume = {323}, editor = {Barman, Siddharth and Lasota, S{\l}awomir}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2024.10}, URN = {urn:nbn:de:0030-drops-221994}, doi = {10.4230/LIPIcs.FSTTCS.2024.10}, annote = {Keywords: Partial derivatives, Apolar ideals, Commuting matrices, Branching programs} }
Sudatta Bhattacharya, Sanjana Dey, Elazar Goldenberg, and Michal Koucký. Many Flavors of Edit Distance. In 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 323, pp. 11:1-11:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{bhattacharya_et_al:LIPIcs.FSTTCS.2024.11, author = {Bhattacharya, Sudatta and Dey, Sanjana and Goldenberg, Elazar and Kouck\'{y}, Michal}, title = {{Many Flavors of Edit Distance}}, booktitle = {44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024)}, pages = {11:1--11:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-355-3}, ISSN = {1868-8969}, year = {2024}, volume = {323}, editor = {Barman, Siddharth and Lasota, S{\l}awomir}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2024.11}, URN = {urn:nbn:de:0030-drops-222004}, doi = {10.4230/LIPIcs.FSTTCS.2024.11}, annote = {Keywords: Edit distance, Indel distance, Embedding, LCS, Alphabet Reduction} }
Sujoy Bhore, Sarfaraz Equbal, and Rohit Gurjar. Parallel Complexity of Geometric Bipartite Matching. In 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 323, pp. 12:1-12:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{bhore_et_al:LIPIcs.FSTTCS.2024.12, author = {Bhore, Sujoy and Equbal, Sarfaraz and Gurjar, Rohit}, title = {{Parallel Complexity of Geometric Bipartite Matching}}, booktitle = {44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024)}, pages = {12:1--12:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-355-3}, ISSN = {1868-8969}, year = {2024}, volume = {323}, editor = {Barman, Siddharth and Lasota, S{\l}awomir}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2024.12}, URN = {urn:nbn:de:0030-drops-222014}, doi = {10.4230/LIPIcs.FSTTCS.2024.12}, annote = {Keywords: Parallel algorithms, Geometric matching, Derandomization, Isolation Lemma} }
Markus Bläser, Julian Dörfler, and Gorav Jindal. PosSLP and Sum of Squares. In 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 323, pp. 13:1-13:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{blaser_et_al:LIPIcs.FSTTCS.2024.13, author = {Bl\"{a}ser, Markus and D\"{o}rfler, Julian and Jindal, Gorav}, title = {{PosSLP and Sum of Squares}}, booktitle = {44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024)}, pages = {13:1--13:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-355-3}, ISSN = {1868-8969}, year = {2024}, volume = {323}, editor = {Barman, Siddharth and Lasota, S{\l}awomir}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2024.13}, URN = {urn:nbn:de:0030-drops-222028}, doi = {10.4230/LIPIcs.FSTTCS.2024.13}, annote = {Keywords: PosSLP, Straight-line program, Polynomial identity testing, Sum of squares} }
Alberto Bombardelli, Laura Bozzelli, César Sánchez, and Stefano Tonetta. Unifying Asynchronous Logics for Hyperproperties. In 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 323, pp. 14:1-14:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{bombardelli_et_al:LIPIcs.FSTTCS.2024.14, author = {Bombardelli, Alberto and Bozzelli, Laura and S\'{a}nchez, C\'{e}sar and Tonetta, Stefano}, title = {{Unifying Asynchronous Logics for Hyperproperties}}, booktitle = {44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024)}, pages = {14:1--14:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-355-3}, ISSN = {1868-8969}, year = {2024}, volume = {323}, editor = {Barman, Siddharth and Lasota, S{\l}awomir}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2024.14}, URN = {urn:nbn:de:0030-drops-222034}, doi = {10.4230/LIPIcs.FSTTCS.2024.14}, annote = {Keywords: Asynchronous hyperproperties, Temporal logics for hyperproperties, Expressiveness, Decidability, Model checking} }
Damien Busatto-Gaston, Youssouf Oualhadj, Léo Tible, and Daniele Varacca. Promptness and Fairness in Muller LTL Formulas. In 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 323, pp. 15:1-15:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{busattogaston_et_al:LIPIcs.FSTTCS.2024.15, author = {Busatto-Gaston, Damien and Oualhadj, Youssouf and Tible, L\'{e}o and Varacca, Daniele}, title = {{Promptness and Fairness in Muller LTL Formulas}}, booktitle = {44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024)}, pages = {15:1--15:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-355-3}, ISSN = {1868-8969}, year = {2024}, volume = {323}, editor = {Barman, Siddharth and Lasota, S{\l}awomir}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2024.15}, URN = {urn:nbn:de:0030-drops-222044}, doi = {10.4230/LIPIcs.FSTTCS.2024.15}, annote = {Keywords: Model checking, Fairness, Temporal logics} }
Deeparnab Chakrabarty and Hang Liao. Learning Partitions Using Rank Queries. In 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 323, pp. 16:1-16:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{chakrabarty_et_al:LIPIcs.FSTTCS.2024.16, author = {Chakrabarty, Deeparnab and Liao, Hang}, title = {{Learning Partitions Using Rank Queries}}, booktitle = {44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024)}, pages = {16:1--16:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-355-3}, ISSN = {1868-8969}, year = {2024}, volume = {323}, editor = {Barman, Siddharth and Lasota, S{\l}awomir}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2024.16}, URN = {urn:nbn:de:0030-drops-222051}, doi = {10.4230/LIPIcs.FSTTCS.2024.16}, annote = {Keywords: Query Complexity, Hypergraph Learning, Matroids} }
L. Sunil Chandran, Rishikesh Gajjala, Shravan Mehra, and Saladi Rahul. Two Results on LPT: A Near-Linear Time Algorithm and Parcel Delivery Using Drones. In 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 323, pp. 17:1-17:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{chandran_et_al:LIPIcs.FSTTCS.2024.17, author = {Chandran, L. Sunil and Gajjala, Rishikesh and Mehra, Shravan and Rahul, Saladi}, title = {{Two Results on LPT: A Near-Linear Time Algorithm and Parcel Delivery Using Drones}}, booktitle = {44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024)}, pages = {17:1--17:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-355-3}, ISSN = {1868-8969}, year = {2024}, volume = {323}, editor = {Barman, Siddharth and Lasota, S{\l}awomir}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2024.17}, URN = {urn:nbn:de:0030-drops-222060}, doi = {10.4230/LIPIcs.FSTTCS.2024.17}, annote = {Keywords: Scheduling, Approximation algorithms, Fine-grained complexity} }
Sravanthi Chede, Leroy Chew, and Anil Shukla. Circuits, Proofs and Propositional Model Counting. In 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 323, pp. 18:1-18:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{chede_et_al:LIPIcs.FSTTCS.2024.18, author = {Chede, Sravanthi and Chew, Leroy and Shukla, Anil}, title = {{Circuits, Proofs and Propositional Model Counting}}, booktitle = {44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024)}, pages = {18:1--18:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-355-3}, ISSN = {1868-8969}, year = {2024}, volume = {323}, editor = {Barman, Siddharth and Lasota, S{\l}awomir}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2024.18}, URN = {urn:nbn:de:0030-drops-222079}, doi = {10.4230/LIPIcs.FSTTCS.2024.18}, annote = {Keywords: Propositional model counting, Boolean circuits, #SAT, Proof Systems, Certified Partition Operation Graph (CPOG)} }
Arjan Cornelissen, Nikhil S. Mande, and Subhasree Patro. Quantum Sabotage Complexity. In 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 323, pp. 19:1-19:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{cornelissen_et_al:LIPIcs.FSTTCS.2024.19, author = {Cornelissen, Arjan and Mande, Nikhil S. and Patro, Subhasree}, title = {{Quantum Sabotage Complexity}}, booktitle = {44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024)}, pages = {19:1--19:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-355-3}, ISSN = {1868-8969}, year = {2024}, volume = {323}, editor = {Barman, Siddharth and Lasota, S{\l}awomir}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2024.19}, URN = {urn:nbn:de:0030-drops-222082}, doi = {10.4230/LIPIcs.FSTTCS.2024.19}, annote = {Keywords: Sabotage complexity, quantum query complexity, Boolean functions, fractional block sensitivity} }
Bireswar Das, Jinia Ghosh, and Anant Kumar. The Isomorphism Problem of Power Graphs and a Question of Cameron. In 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 323, pp. 20:1-20:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{das_et_al:LIPIcs.FSTTCS.2024.20, author = {Das, Bireswar and Ghosh, Jinia and Kumar, Anant}, title = {{The Isomorphism Problem of Power Graphs and a Question of Cameron}}, booktitle = {44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024)}, pages = {20:1--20:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-355-3}, ISSN = {1868-8969}, year = {2024}, volume = {323}, editor = {Barman, Siddharth and Lasota, S{\l}awomir}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2024.20}, URN = {urn:nbn:de:0030-drops-222095}, doi = {10.4230/LIPIcs.FSTTCS.2024.20}, annote = {Keywords: Graph Isomorphism, Graphs defined on Groups, Power Graphs, Enhanced Power Graphs, Directed Power Graphs, Nilpotent Groups} }
Kyveli Doveri, Pierre Ganty, and B. Srivathsan. A Myhill-Nerode Style Characterization for Timed Automata with Integer Resets. In 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 323, pp. 21:1-21:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{doveri_et_al:LIPIcs.FSTTCS.2024.21, author = {Doveri, Kyveli and Ganty, Pierre and Srivathsan, B.}, title = {{A Myhill-Nerode Style Characterization for Timed Automata with Integer Resets}}, booktitle = {44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024)}, pages = {21:1--21:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-355-3}, ISSN = {1868-8969}, year = {2024}, volume = {323}, editor = {Barman, Siddharth and Lasota, S{\l}awomir}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2024.21}, URN = {urn:nbn:de:0030-drops-222108}, doi = {10.4230/LIPIcs.FSTTCS.2024.21}, annote = {Keywords: Timed languages, Timed automata, Canonical representation, Myhill-Nerode equivalence, Integer reset} }
Bernd Finkbeiner, Felix Jahn, and Julian Siber. Counterfactual Explanations for MITL Violations. In 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 323, pp. 22:1-22:25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{finkbeiner_et_al:LIPIcs.FSTTCS.2024.22, author = {Finkbeiner, Bernd and Jahn, Felix and Siber, Julian}, title = {{Counterfactual Explanations for MITL Violations}}, booktitle = {44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024)}, pages = {22:1--22:25}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-355-3}, ISSN = {1868-8969}, year = {2024}, volume = {323}, editor = {Barman, Siddharth and Lasota, S{\l}awomir}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2024.22}, URN = {urn:nbn:de:0030-drops-222116}, doi = {10.4230/LIPIcs.FSTTCS.2024.22}, annote = {Keywords: Timed automata, actual causality, metric interval temporal logic} }
Karthik Gajulapalli, Zeyong Li, and Ilya Volkovich. Oblivious Complexity Classes Revisited: Lower Bounds and Hierarchies. In 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 323, pp. 23:1-23:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{gajulapalli_et_al:LIPIcs.FSTTCS.2024.23, author = {Gajulapalli, Karthik and Li, Zeyong and Volkovich, Ilya}, title = {{Oblivious Complexity Classes Revisited: Lower Bounds and Hierarchies}}, booktitle = {44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024)}, pages = {23:1--23:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-355-3}, ISSN = {1868-8969}, year = {2024}, volume = {323}, editor = {Barman, Siddharth and Lasota, S{\l}awomir}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2024.23}, URN = {urn:nbn:de:0030-drops-222122}, doi = {10.4230/LIPIcs.FSTTCS.2024.23}, annote = {Keywords: fixed circuit lower bounds, semantic time hierarchy, oblivious complexity, range avoidance} }
Sushmita Gupta, Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Fahad Panolan, and Saket Saurabh. When Far Is Better: The Chamberlin-Courant Approach to Obnoxious Committee Selection. In 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 323, pp. 24:1-24:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{gupta_et_al:LIPIcs.FSTTCS.2024.24, author = {Gupta, Sushmita and Inamdar, Tanmay and Jain, Pallavi and Lokshtanov, Daniel and Panolan, Fahad and Saurabh, Saket}, title = {{When Far Is Better: The Chamberlin-Courant Approach to Obnoxious Committee Selection}}, booktitle = {44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024)}, pages = {24:1--24:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-355-3}, ISSN = {1868-8969}, year = {2024}, volume = {323}, editor = {Barman, Siddharth and Lasota, S{\l}awomir}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2024.24}, URN = {urn:nbn:de:0030-drops-222135}, doi = {10.4230/LIPIcs.FSTTCS.2024.24}, annote = {Keywords: Metric Space, Parameterized Complexity, Approximation, Obnoxious Facility Location} }
Nathaniel Harms and Artur Riazanov. Better Boosting of Communication Oracles, or Not. In 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 323, pp. 25:1-25:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{harms_et_al:LIPIcs.FSTTCS.2024.25, author = {Harms, Nathaniel and Riazanov, Artur}, title = {{Better Boosting of Communication Oracles, or Not}}, booktitle = {44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024)}, pages = {25:1--25:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-355-3}, ISSN = {1868-8969}, year = {2024}, volume = {323}, editor = {Barman, Siddharth and Lasota, S{\l}awomir}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2024.25}, URN = {urn:nbn:de:0030-drops-222143}, doi = {10.4230/LIPIcs.FSTTCS.2024.25}, annote = {Keywords: oracles, error reduction, communication complexity} }
Furio Honsell, Marina Lenisa, and Ivan Scagnetto. Two Views on Unification: Terms as Strategies. In 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 323, pp. 26:1-26:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{honsell_et_al:LIPIcs.FSTTCS.2024.26, author = {Honsell, Furio and Lenisa, Marina and Scagnetto, Ivan}, title = {{Two Views on Unification: Terms as Strategies}}, booktitle = {44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024)}, pages = {26:1--26:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-355-3}, ISSN = {1868-8969}, year = {2024}, volume = {323}, editor = {Barman, Siddharth and Lasota, S{\l}awomir}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2024.26}, URN = {urn:nbn:de:0030-drops-222158}, doi = {10.4230/LIPIcs.FSTTCS.2024.26}, annote = {Keywords: unification, geometry of interaction, games} }
Arindam Khan, Aditya Subramanian, Tobias Widmann, and Andreas Wiese. On Approximation Schemes for Stabbing Rectilinear Polygons. In 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 323, pp. 27:1-27:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{khan_et_al:LIPIcs.FSTTCS.2024.27, author = {Khan, Arindam and Subramanian, Aditya and Widmann, Tobias and Wiese, Andreas}, title = {{On Approximation Schemes for Stabbing Rectilinear Polygons}}, booktitle = {44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024)}, pages = {27:1--27:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-355-3}, ISSN = {1868-8969}, year = {2024}, volume = {323}, editor = {Barman, Siddharth and Lasota, S{\l}awomir}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2024.27}, URN = {urn:nbn:de:0030-drops-222166}, doi = {10.4230/LIPIcs.FSTTCS.2024.27}, annote = {Keywords: Approximation Algorithms, Stabbing, Rectangles, Rectilinear Polygons, QPTAS, APX-hardness} }
Christian Komusiewicz and Jannik Schestag. Maximizing Phylogenetic Diversity Under Ecological Constraints: A Parameterized Complexity Study. In 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 323, pp. 28:1-28:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{komusiewicz_et_al:LIPIcs.FSTTCS.2024.28, author = {Komusiewicz, Christian and Schestag, Jannik}, title = {{Maximizing Phylogenetic Diversity Under Ecological Constraints: A Parameterized Complexity Study}}, booktitle = {44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024)}, pages = {28:1--28:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-355-3}, ISSN = {1868-8969}, year = {2024}, volume = {323}, editor = {Barman, Siddharth and Lasota, S{\l}awomir}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2024.28}, URN = {urn:nbn:de:0030-drops-222175}, doi = {10.4230/LIPIcs.FSTTCS.2024.28}, annote = {Keywords: phylogenetic diversity, food-webs, structural parameterization, color-coding, dynamic programming} }
Christian Konrad, Andrew McGregor, Rik Sengupta, and Cuong Than. Matchings in Low-Arboricity Graphs in the Dynamic Graph Stream Model. In 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 323, pp. 29:1-29:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{konrad_et_al:LIPIcs.FSTTCS.2024.29, author = {Konrad, Christian and McGregor, Andrew and Sengupta, Rik and Than, Cuong}, title = {{Matchings in Low-Arboricity Graphs in the Dynamic Graph Stream Model}}, booktitle = {44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024)}, pages = {29:1--29:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-355-3}, ISSN = {1868-8969}, year = {2024}, volume = {323}, editor = {Barman, Siddharth and Lasota, S{\l}awomir}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2024.29}, URN = {urn:nbn:de:0030-drops-222187}, doi = {10.4230/LIPIcs.FSTTCS.2024.29}, annote = {Keywords: Data Streams, Graph Matching, Graph Arboricity} }
Anand Louis, Alantha Newman, and Arka Ray. Improved Linearly Ordered Colorings of Hypergraphs via SDP Rounding. In 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 323, pp. 30:1-30:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{louis_et_al:LIPIcs.FSTTCS.2024.30, author = {Louis, Anand and Newman, Alantha and Ray, Arka}, title = {{Improved Linearly Ordered Colorings of Hypergraphs via SDP Rounding}}, booktitle = {44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024)}, pages = {30:1--30:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-355-3}, ISSN = {1868-8969}, year = {2024}, volume = {323}, editor = {Barman, Siddharth and Lasota, S{\l}awomir}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2024.30}, URN = {urn:nbn:de:0030-drops-222199}, doi = {10.4230/LIPIcs.FSTTCS.2024.30}, annote = {Keywords: hypergraph coloring, SDP rounding, promise constraint satisfaction problems} }
Rogers Mathew, Fahad Panolan, and Seshikanth. Parameterized Algorithms and Hardness for the Maximum Edge q-Coloring Problem. In 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 323, pp. 31:1-31:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{mathew_et_al:LIPIcs.FSTTCS.2024.31, author = {Mathew, Rogers and Panolan, Fahad and Seshikanth}, title = {{Parameterized Algorithms and Hardness for the Maximum Edge q-Coloring Problem}}, booktitle = {44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024)}, pages = {31:1--31:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-355-3}, ISSN = {1868-8969}, year = {2024}, volume = {323}, editor = {Barman, Siddharth and Lasota, S{\l}awomir}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2024.31}, URN = {urn:nbn:de:0030-drops-222202}, doi = {10.4230/LIPIcs.FSTTCS.2024.31}, annote = {Keywords: FPT algorithm, Edge coloring, Treewidth, W\lbrack1\rbrack-hardness} }
Pierre Popoli, Jeffrey Shallit, and Manon Stipulanti. Additive Word Complexity and Walnut. In 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 323, pp. 32:1-32:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{popoli_et_al:LIPIcs.FSTTCS.2024.32, author = {Popoli, Pierre and Shallit, Jeffrey and Stipulanti, Manon}, title = {{Additive Word Complexity and Walnut}}, booktitle = {44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024)}, pages = {32:1--32:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-355-3}, ISSN = {1868-8969}, year = {2024}, volume = {323}, editor = {Barman, Siddharth and Lasota, S{\l}awomir}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2024.32}, URN = {urn:nbn:de:0030-drops-222218}, doi = {10.4230/LIPIcs.FSTTCS.2024.32}, annote = {Keywords: Combinatorics on words, Abelian complexity, Additive complexity, Automatic sequences, Walnut software} }
Shanthanu S. Rai. Pseudo-Deterministic Construction of Irreducible Polynomials over Finite Fields. In 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 323, pp. 33:1-33:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{rai:LIPIcs.FSTTCS.2024.33, author = {Rai, Shanthanu S.}, title = {{Pseudo-Deterministic Construction of Irreducible Polynomials over Finite Fields}}, booktitle = {44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024)}, pages = {33:1--33:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-355-3}, ISSN = {1868-8969}, year = {2024}, volume = {323}, editor = {Barman, Siddharth and Lasota, S{\l}awomir}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2024.33}, URN = {urn:nbn:de:0030-drops-222227}, doi = {10.4230/LIPIcs.FSTTCS.2024.33}, annote = {Keywords: Algebra and Computation, Finite fields, Factorization, Pseudo-deterministic, Polynomials} }
Yinfeng Zhu. A Quadratic Upper Bound on the Reset Thresholds of Synchronizing Automata Containing a Transitive Permutation Group. In 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 323, pp. 34:1-34:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{zhu:LIPIcs.FSTTCS.2024.34, author = {Zhu, Yinfeng}, title = {{A Quadratic Upper Bound on the Reset Thresholds of Synchronizing Automata Containing a Transitive Permutation Group}}, booktitle = {44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024)}, pages = {34:1--34:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-355-3}, ISSN = {1868-8969}, year = {2024}, volume = {323}, editor = {Barman, Siddharth and Lasota, S{\l}awomir}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2024.34}, URN = {urn:nbn:de:0030-drops-222236}, doi = {10.4230/LIPIcs.FSTTCS.2024.34}, annote = {Keywords: \v{C}ern\'{y} conjecture, deterministic finite automaton, permutation group, reset threshold, synchronizing automaton} }
Feedback for Dagstuhl Publishing