LIPIcs, Volume 323, FSTTCS 2024

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