<h2>LIPIcs, Volume 323, FSTTCS 2024</h2>
<ul>
<li>
<span class="authors">Siddharth Barman and Sławomir Lasota</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2024.0">10.4230/LIPIcs.FSTTCS.2024.0</a>
</li>
<li>
<span class="authors">Dmitry Chistikov</span>
<span class="title">An Introduction to the Theory of Linear Integer Arithmetic (Invited Paper)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2024.1">10.4230/LIPIcs.FSTTCS.2024.1</a>
</li>
<li>
<span class="authors">Sebastian Siebertz and Alexandre Vigny</span>
<span class="title">Advances in Algorithmic Meta Theorems (Invited Paper)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2024.2">10.4230/LIPIcs.FSTTCS.2024.2</a>
</li>
<li>
<span class="authors">Étienne André, Johan Arcile, and Engel Lefaucheux</span>
<span class="title">Execution-Time Opacity Problems in One-Clock Parametric Timed Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2024.3">10.4230/LIPIcs.FSTTCS.2024.3</a>
</li>
<li>
<span class="authors">V. Arvind, Samir Datta, Asif Khan, Shivdutt Sharma, Yadu Vasudev, and Shankar Ram Vasudevan</span>
<span class="title">The Parallel Dynamic Complexity of the Abelian Cayley Group Membership Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2024.4">10.4230/LIPIcs.FSTTCS.2024.4</a>
</li>
<li>
<span class="authors">Ali Asadi, Krishnendu Chatterjee, Raimundo Saona, and Jakub Svoboda</span>
<span class="title">Concurrent Stochastic Games with Stateful-Discounted and Parity Objectives: Complexity and Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2024.5">10.4230/LIPIcs.FSTTCS.2024.5</a>
</li>
<li>
<span class="authors">Nikhil Ayyadevara, Ashish Chiplunkar, and Amatya Sharma</span>
<span class="title">A Decomposition Approach to the Weighted k-Server Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2024.6">10.4230/LIPIcs.FSTTCS.2024.6</a>
</li>
<li>
<span class="authors">Aritra Banik, Sayani Das, Anil Maheshwari, Bubai Manna, Subhas C. Nandy, Krishna Priya K. M., Bodhayan Roy, Sasanka Roy, and Abhishek Sahu</span>
<span class="title">Minimum Consistent Subset in Trees and Interval Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2024.7">10.4230/LIPIcs.FSTTCS.2024.7</a>
</li>
<li>
<span class="authors">Benoît Barbot, Patricia Bouyer, and Serge Haddad</span>
<span class="title">Beyond Decisiveness of Infinite Markov Chains</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2024.8">10.4230/LIPIcs.FSTTCS.2024.8</a>
</li>
<li>
<span class="authors">Dylan Bellier, Massimo Benerecetti, Fabio Mogavero, and Sophie Pinchinat</span>
<span class="title">Plan Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2024.9">10.4230/LIPIcs.FSTTCS.2024.9</a>
</li>
<li>
<span class="authors">Vishwas Bhargava and Anamay Tengse</span>
<span class="title">Explicit Commutative ROABPs from Partial Derivatives</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2024.10">10.4230/LIPIcs.FSTTCS.2024.10</a>
</li>
<li>
<span class="authors">Sudatta Bhattacharya, Sanjana Dey, Elazar Goldenberg, and Michal Koucký</span>
<span class="title">Many Flavors of Edit Distance</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2024.11">10.4230/LIPIcs.FSTTCS.2024.11</a>
</li>
<li>
<span class="authors">Sujoy Bhore, Sarfaraz Equbal, and Rohit Gurjar</span>
<span class="title">Parallel Complexity of Geometric Bipartite Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2024.12">10.4230/LIPIcs.FSTTCS.2024.12</a>
</li>
<li>
<span class="authors">Markus Bläser, Julian Dörfler, and Gorav Jindal</span>
<span class="title">PosSLP and Sum of Squares</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2024.13">10.4230/LIPIcs.FSTTCS.2024.13</a>
</li>
<li>
<span class="authors">Alberto Bombardelli, Laura Bozzelli, César Sánchez, and Stefano Tonetta</span>
<span class="title">Unifying Asynchronous Logics for Hyperproperties</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2024.14">10.4230/LIPIcs.FSTTCS.2024.14</a>
</li>
<li>
<span class="authors">Damien Busatto-Gaston, Youssouf Oualhadj, Léo Tible, and Daniele Varacca</span>
<span class="title">Promptness and Fairness in Muller LTL Formulas</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2024.15">10.4230/LIPIcs.FSTTCS.2024.15</a>
</li>
<li>
<span class="authors">Deeparnab Chakrabarty and Hang Liao</span>
<span class="title">Learning Partitions Using Rank Queries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2024.16">10.4230/LIPIcs.FSTTCS.2024.16</a>
</li>
<li>
<span class="authors">L. Sunil Chandran, Rishikesh Gajjala, Shravan Mehra, and Saladi Rahul</span>
<span class="title">Two Results on LPT: A Near-Linear Time Algorithm and Parcel Delivery Using Drones</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2024.17">10.4230/LIPIcs.FSTTCS.2024.17</a>
</li>
<li>
<span class="authors">Sravanthi Chede, Leroy Chew, and Anil Shukla</span>
<span class="title">Circuits, Proofs and Propositional Model Counting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2024.18">10.4230/LIPIcs.FSTTCS.2024.18</a>
</li>
<li>
<span class="authors">Arjan Cornelissen, Nikhil S. Mande, and Subhasree Patro</span>
<span class="title">Quantum Sabotage Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2024.19">10.4230/LIPIcs.FSTTCS.2024.19</a>
</li>
<li>
<span class="authors">Bireswar Das, Jinia Ghosh, and Anant Kumar</span>
<span class="title">The Isomorphism Problem of Power Graphs and a Question of Cameron</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2024.20">10.4230/LIPIcs.FSTTCS.2024.20</a>
</li>
<li>
<span class="authors">Kyveli Doveri, Pierre Ganty, and B. Srivathsan</span>
<span class="title">A Myhill-Nerode Style Characterization for Timed Automata with Integer Resets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2024.21">10.4230/LIPIcs.FSTTCS.2024.21</a>
</li>
<li>
<span class="authors">Bernd Finkbeiner, Felix Jahn, and Julian Siber</span>
<span class="title">Counterfactual Explanations for MITL Violations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2024.22">10.4230/LIPIcs.FSTTCS.2024.22</a>
</li>
<li>
<span class="authors">Karthik Gajulapalli, Zeyong Li, and Ilya Volkovich</span>
<span class="title">Oblivious Complexity Classes Revisited: Lower Bounds and Hierarchies</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2024.23">10.4230/LIPIcs.FSTTCS.2024.23</a>
</li>
<li>
<span class="authors">Sushmita Gupta, Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Fahad Panolan, and Saket Saurabh</span>
<span class="title">When Far Is Better: The Chamberlin-Courant Approach to Obnoxious Committee Selection</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2024.24">10.4230/LIPIcs.FSTTCS.2024.24</a>
</li>
<li>
<span class="authors">Nathaniel Harms and Artur Riazanov</span>
<span class="title">Better Boosting of Communication Oracles, or Not</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2024.25">10.4230/LIPIcs.FSTTCS.2024.25</a>
</li>
<li>
<span class="authors">Furio Honsell, Marina Lenisa, and Ivan Scagnetto</span>
<span class="title">Two Views on Unification: Terms as Strategies</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2024.26">10.4230/LIPIcs.FSTTCS.2024.26</a>
</li>
<li>
<span class="authors">Arindam Khan, Aditya Subramanian, Tobias Widmann, and Andreas Wiese</span>
<span class="title">On Approximation Schemes for Stabbing Rectilinear Polygons</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2024.27">10.4230/LIPIcs.FSTTCS.2024.27</a>
</li>
<li>
<span class="authors">Christian Komusiewicz and Jannik Schestag</span>
<span class="title">Maximizing Phylogenetic Diversity Under Ecological Constraints: A Parameterized Complexity Study</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2024.28">10.4230/LIPIcs.FSTTCS.2024.28</a>
</li>
<li>
<span class="authors">Christian Konrad, Andrew McGregor, Rik Sengupta, and Cuong Than</span>
<span class="title">Matchings in Low-Arboricity Graphs in the Dynamic Graph Stream Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2024.29">10.4230/LIPIcs.FSTTCS.2024.29</a>
</li>
<li>
<span class="authors">Anand Louis, Alantha Newman, and Arka Ray</span>
<span class="title">Improved Linearly Ordered Colorings of Hypergraphs via SDP Rounding</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2024.30">10.4230/LIPIcs.FSTTCS.2024.30</a>
</li>
<li>
<span class="authors">Rogers Mathew, Fahad Panolan, and Seshikanth</span>
<span class="title">Parameterized Algorithms and Hardness for the Maximum Edge q-Coloring Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2024.31">10.4230/LIPIcs.FSTTCS.2024.31</a>
</li>
<li>
<span class="authors">Pierre Popoli, Jeffrey Shallit, and Manon Stipulanti</span>
<span class="title">Additive Word Complexity and Walnut</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2024.32">10.4230/LIPIcs.FSTTCS.2024.32</a>
</li>
<li>
<span class="authors">Shanthanu S. Rai</span>
<span class="title">Pseudo-Deterministic Construction of Irreducible Polynomials over Finite Fields</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2024.33">10.4230/LIPIcs.FSTTCS.2024.33</a>
</li>
<li>
<span class="authors">Yinfeng Zhu</span>
<span class="title">A Quadratic Upper Bound on the Reset Thresholds of Synchronizing Automata Containing a Transitive Permutation Group</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2024.34">10.4230/LIPIcs.FSTTCS.2024.34</a>
</li>
<li>
<span class="authors">Siddharth Barman and Sławomir Lasota</span>
<span class="title">LIPIcs, Volume 323, FSTTCS 2024, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2024">10.4230/LIPIcs.FSTTCS.2024</a>
</li>
</ul>
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