default search action
44th FSTTCS 2024: Gandhinagar, India
- Siddharth Barman
, Slawomir Lasota
44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2024, December 16-18, 2024, Gandhinagar, Gujarat, India. LIPIcs 323, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-355-3 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xviii
- Dmitry Chistikov:
An Introduction to the Theory of Linear Integer Arithmetic (Invited Paper). 1:1-1:36 - Sebastian Siebertz, Alexandre Vigny:
Advances in Algorithmic Meta Theorems (Invited Paper). 2:1-2:29 - Étienne André, Johan Arcile, Engel Lefaucheux:
Execution-Time Opacity Problems in One-Clock Parametric Timed Automata. 3:1-3:22 - Vikraman Arvind, Samir Datta, Asif Khan, Shivdutt Sharma, Yadu Vasudev, Shankar Ram Vasudevan:
The Parallel Dynamic Complexity of the Abelian Cayley Group Membership Problem. 4:1-4:23 - Ali Asadi, Krishnendu Chatterjee, Raimundo Saona, Jakub Svoboda
Concurrent Stochastic Games with Stateful-Discounted and Parity Objectives: Complexity and Algorithms. 5:1-5:17 - Nikhil Ayyadevara, Ashish Chiplunkar, Amatya Sharma:
A Decomposition Approach to the Weighted k-Server Problem. 6:1-6:17 - Aritra Banik, Sayani Das, Anil Maheshwari, Bubai Manna, Subhas C. Nandy, Krishna Priya K. M., Bodhayan Roy, Sasanka Roy, Abhishek Sahu:
Minimum Consistent Subset in Trees and Interval Graphs. 7:1-7:15 - Benoît Barbot, Patricia Bouyer, Serge Haddad:
Beyond Decisiveness of Infinite Markov Chains. 8:1-8:22 - Dylan Bellier, Massimo Benerecetti, Fabio Mogavero, Sophie Pinchinat:
Plan Logic. 9:1-9:18 - Vishwas Bhargava, Anamay Tengse:
Explicit Commutative ROABPs from Partial Derivatives. 10:1-10:15 - Sudatta Bhattacharya
Many Flavors of Edit Distance. 11:1-11:16 - Sujoy Bhore, Sarfaraz Equbal, Rohit Gurjar:
Parallel Complexity of Geometric Bipartite Matching. 12:1-12:15 - Markus Bläser, Julian Dörfler, Gorav Jindal:
PosSLP and Sum of Squares. 13:1-13:18 - Alberto Bombardelli
Unifying Asynchronous Logics for Hyperproperties. 14:1-14:18 - Damien Busatto-Gaston, Youssouf Oualhadj, Léo Tible, Daniele Varacca:
Promptness and Fairness in Muller LTL Formulas. 15:1-15:22 - Deeparnab Chakrabarty, Hang Liao:
Learning Partitions Using Rank Queries. 16:1-16:14 - L. Sunil Chandran, Rishikesh Gajjala, Shravan Mehra, Saladi Rahul:
Two Results on LPT: A Near-Linear Time Algorithm and Parcel Delivery Using Drones. 17:1-17:15 - Sravanthi Chede, Leroy Chew, Anil Shukla:
Circuits, Proofs and Propositional Model Counting. 18:1-18:23 - Arjan Cornelissen, Nikhil S. Mande, Subhasree Patro:
Quantum Sabotage Complexity. 19:1-19:20 - Bireswar Das, Jinia Ghosh, Anant Kumar:
The Isomorphism Problem of Power Graphs and a Question of Cameron. 20:1-20:23 - Kyveli Doveri, Pierre Ganty, B. Srivathsan:
A Myhill-Nerode Style Characterization for Timed Automata with Integer Resets. 21:1-21:18 - Bernd Finkbeiner, Felix Jahn, Julian Siber:
Counterfactual Explanations for MITL Violations. 22:1-22:25 - Karthik Gajulapalli, Zeyong Li, Ilya Volkovich:
Oblivious Complexity Classes Revisited: Lower Bounds and Hierarchies. 23:1-23:19 - Sushmita Gupta, Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
When Far Is Better: The Chamberlin-Courant Approach to Obnoxious Committee Selection. 24:1-24:21 - Nathaniel Harms, Artur Riazanov:
Better Boosting of Communication Oracles, or Not. 25:1-25:14 - Furio Honsell, Marina Lenisa, Ivan Scagnetto:
Two Views on Unification: Terms as Strategies. 26:1-26:15 - Arindam Khan, Aditya Subramanian, Tobias Widmann, Andreas Wiese:
On Approximation Schemes for Stabbing Rectilinear Polygons. 27:1-27:18 - Christian Komusiewicz, Jannik Schestag:
Maximizing Phylogenetic Diversity Under Ecological Constraints: A Parameterized Complexity Study. 28:1-28:18 - Christian Konrad, Andrew McGregor, Rik Sengupta, Cuong Than:
Matchings in Low-Arboricity Graphs in the Dynamic Graph Stream Model. 29:1-29:15 - Anand Louis, Alantha Newman, Arka Ray
Improved Linearly Ordered Colorings of Hypergraphs via SDP Rounding. 30:1-30:19 - Rogers Mathew
Parameterized Algorithms and Hardness for the Maximum Edge q-Coloring Problem. 31:1-31:12 - Pierre Popoli
Additive Word Complexity and Walnut. 32:1-32:18 - Shanthanu S. Rai:
Pseudo-Deterministic Construction of Irreducible Polynomials over Finite Fields. 33:1-33:12 - Yinfeng Zhu:
A Quadratic Upper Bound on the Reset Thresholds of Synchronizing Automata Containing a Transitive Permutation Group. 34:1-34:14
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-06-25 20:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: