@Proceedings{ganguly_et_al:LIPIcs.FSTTCS.2018,
title = {{LIPIcs, Volume 122, FSTTCS'18, Complete Volume}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018},
URN = {urn:nbn:de:0030-drops-100240},
doi = {10.4230/LIPIcs.FSTTCS.2018},
annote = {Keywords: Theory of Computation}
}
@InProceedings{ganguly_et_al:LIPIcs.FSTTCS.2018.0,
author = {Ganguly, Sumit and Pandya, Paritosh},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {0:i--0:xiv},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.0},
URN = {urn:nbn:de:0030-drops-98992},
doi = {10.4230/LIPIcs.FSTTCS.2018.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{majumdar:LIPIcs.FSTTCS.2018.1,
author = {Majumdar, Rupak},
title = {{Random Testing for Distributed Systems with Theoretical Guarantees}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {1:1--1:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.1},
URN = {urn:nbn:de:0030-drops-99000},
doi = {10.4230/LIPIcs.FSTTCS.2018.1},
annote = {Keywords: Random testing, Hitting families}
}
@InProceedings{sistla:LIPIcs.FSTTCS.2018.2,
author = {Sistla, A. Prasad},
title = {{Model Checking Randomized Security Protocols}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {2:1--2:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.2},
URN = {urn:nbn:de:0030-drops-99018},
doi = {10.4230/LIPIcs.FSTTCS.2018.2},
annote = {Keywords: Randomized Protocols, Verification}
}
@InProceedings{svensson:LIPIcs.FSTTCS.2018.3,
author = {Svensson, Ola},
title = {{Algorithms for the Asymmetric Traveling Salesman Problem}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {3:1--3:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.3},
URN = {urn:nbn:de:0030-drops-99024},
doi = {10.4230/LIPIcs.FSTTCS.2018.3},
annote = {Keywords: Approximation algorithms, combinatorial optimization, linear programming, traveling salesman problem}
}
@InProceedings{vempala:LIPIcs.FSTTCS.2018.4,
author = {Vempala, Santosh},
title = {{Continuous Algorithms}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {4:1--4:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.4},
URN = {urn:nbn:de:0030-drops-99037},
doi = {10.4230/LIPIcs.FSTTCS.2018.4},
annote = {Keywords: Algorithms}
}
@InProceedings{bhandari_et_al:LIPIcs.FSTTCS.2018.5,
author = {Bhandari, Siddharth and Harsha, Prahladh and Molli, Tulasimohan and Srinivasan, Srikanth},
title = {{On the Probabilistic Degree of OR over the Reals}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {5:1--5:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.5},
URN = {urn:nbn:de:0030-drops-99044},
doi = {10.4230/LIPIcs.FSTTCS.2018.5},
annote = {Keywords: Polynomials over reals, probabilistic polynomials, probabilistic degree, OR polynomial}
}
@InProceedings{saptharishi_et_al:LIPIcs.FSTTCS.2018.6,
author = {Saptharishi, Ramprasad and Tengse, Anamay},
title = {{Quasipolynomial Hitting Sets for Circuits with Restricted Parse Trees}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {6:1--6:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.6},
URN = {urn:nbn:de:0030-drops-99050},
doi = {10.4230/LIPIcs.FSTTCS.2018.6},
annote = {Keywords: Unambiguous Circuits, Read-once Oblivious ABPs, Polynomial Identity Testing, Lower Bounds, Algebraic Circuit Complexity}
}
@InProceedings{arvind_et_al:LIPIcs.FSTTCS.2018.7,
author = {Arvind, V. and Chatterjee, Abhranil and Datta, Rajit and Mukhopadhyay, Partha},
title = {{Univariate Ideal Membership Parameterized by Rank, Degree, and Number of Generators}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {7:1--7:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.7},
URN = {urn:nbn:de:0030-drops-99068},
doi = {10.4230/LIPIcs.FSTTCS.2018.7},
annote = {Keywords: Combinatorial Nullstellensatz, Ideal Membership, Parametric Hardness, Low Rank Permanent}
}
@InProceedings{abdulla_et_al:LIPIcs.FSTTCS.2018.8,
author = {Abdulla, Parosh Aziz and Atig, Mohamed Faouzi and Krishna, Shankara Narayanan and Vaidya, Shaan},
title = {{Verification of Timed Asynchronous Programs}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {8:1--8:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.8},
URN = {urn:nbn:de:0030-drops-99076},
doi = {10.4230/LIPIcs.FSTTCS.2018.8},
annote = {Keywords: Reachability, Timed Automata, Asynchronous programs}
}
@InProceedings{abuzaid_et_al:LIPIcs.FSTTCS.2018.9,
author = {Abu Zaid, Faried and K\"{o}cher, Chris},
title = {{The Cayley-Graph of the Queue Monoid: Logic and Decidability}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {9:1--9:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.9},
URN = {urn:nbn:de:0030-drops-99088},
doi = {10.4230/LIPIcs.FSTTCS.2018.9},
annote = {Keywords: Queues, Transformation Monoid, Cayley-Graph, Logic, First-Order Theory, MSO Theory, Model Checking}
}
@InProceedings{abuzaid:LIPIcs.FSTTCS.2018.10,
author = {Abu Zaid, Faried},
title = {{Uniformly Automatic Classes of Finite Structures}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {10:1--10:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.10},
URN = {urn:nbn:de:0030-drops-99095},
doi = {10.4230/LIPIcs.FSTTCS.2018.10},
annote = {Keywords: Automatic Structures, Model Checking, Fixed-Parameter Tractability, Algorithmic Meta Theorems}
}
@InProceedings{goldenberg_et_al:LIPIcs.FSTTCS.2018.11,
author = {Goldenberg, Elazar and C. S., Karthik},
title = {{Towards a General Direct Product Testing Theorem}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {11:1--11:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.11},
URN = {urn:nbn:de:0030-drops-99105},
doi = {10.4230/LIPIcs.FSTTCS.2018.11},
annote = {Keywords: Property Testing, Direct Product, PCP, Johnson graph, Ramanujan Complex, Derandomization}
}
@InProceedings{kesh:LIPIcs.FSTTCS.2018.12,
author = {Kesh, Deepanjan},
title = {{Space Complexity of Two Adaptive Bitprobe Schemes Storing Three Elements}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {12:1--12:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.12},
URN = {urn:nbn:de:0030-drops-99110},
doi = {10.4230/LIPIcs.FSTTCS.2018.12},
annote = {Keywords: Data structures, set membership problem, bitprobe model, lower bound}
}
@InProceedings{chaubal_et_al:LIPIcs.FSTTCS.2018.13,
author = {Chaubal, Siddhesh and G\'{a}l, Anna},
title = {{New Constructions with Quadratic Separation between Sensitivity and Block Sensitivity}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {13:1--13:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.13},
URN = {urn:nbn:de:0030-drops-99129},
doi = {10.4230/LIPIcs.FSTTCS.2018.13},
annote = {Keywords: Sensitivity Conjecture, Boolean Functions, Complexity Measures}
}
@InProceedings{asada_et_al:LIPIcs.FSTTCS.2018.14,
author = {Asada, Kazuyuki and Kobayashi, Naoki},
title = {{Lambda-Definable Order-3 Tree Functions are Well-Quasi-Ordered}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {14:1--14:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.14},
URN = {urn:nbn:de:0030-drops-99138},
doi = {10.4230/LIPIcs.FSTTCS.2018.14},
annote = {Keywords: higher-order grammar, pumping lemma, Kruskal's tree theorem, well-quasi-ordering, simply-typed lambda calculus}
}
@InProceedings{baelde_et_al:LIPIcs.FSTTCS.2018.15,
author = {Baelde, David and Lick, Anthony and Schmitz, Sylvain},
title = {{A Hypersequent Calculus with Clusters for Tense Logic over Ordinals}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {15:1--15:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.15},
URN = {urn:nbn:de:0030-drops-99143},
doi = {10.4230/LIPIcs.FSTTCS.2018.15},
annote = {Keywords: modal logic, proof system, hypersequent}
}
@InProceedings{bagnol_et_al:LIPIcs.FSTTCS.2018.16,
author = {Bagnol, Marc and Kuperberg, Denis},
title = {{B\"{u}chi Good-for-Games Automata Are Efficiently Recognizable}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {16:1--16:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.16},
URN = {urn:nbn:de:0030-drops-99157},
doi = {10.4230/LIPIcs.FSTTCS.2018.16},
annote = {Keywords: B\"{u}chi, automata, games, polynomial time, nondeterminism}
}
@InProceedings{cseh_et_al:LIPIcs.FSTTCS.2018.17,
author = {Cseh, \'{A}gnes and Kavitha, Telikepalli},
title = {{Popular Matchings in Complete Graphs}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {17:1--17:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.17},
URN = {urn:nbn:de:0030-drops-99164},
doi = {10.4230/LIPIcs.FSTTCS.2018.17},
annote = {Keywords: popular matching, complete graph, complexity, linear programming}
}
@InProceedings{blaser_et_al:LIPIcs.FSTTCS.2018.18,
author = {Bl\"{a}ser, Markus and Komarath, Balagopal and Sreenivasaiah, Karteek},
title = {{Graph Pattern Polynomials}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {18:1--18:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.18},
URN = {urn:nbn:de:0030-drops-99172},
doi = {10.4230/LIPIcs.FSTTCS.2018.18},
annote = {Keywords: algorithms, induced subgraph detection, algebraic framework}
}
@InProceedings{datta_et_al:LIPIcs.FSTTCS.2018.19,
author = {Datta, Samir and Iyer, Siddharth and Kulkarni, Raghav and Mukherjee, Anish},
title = {{Shortest k-Disjoint Paths via Determinants}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {19:1--19:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.19},
URN = {urn:nbn:de:0030-drops-99183},
doi = {10.4230/LIPIcs.FSTTCS.2018.19},
annote = {Keywords: disjoint paths, planar graph, parallel algorithm, cycle cover, determinant, inclusion-exclusion}
}
@InProceedings{berard_et_al:LIPIcs.FSTTCS.2018.20,
author = {B\'{e}rard, B\'{e}atrice and Haar, Stefan and H\'{e}lou\"{e}t, Loic},
title = {{Hyper Partial Order Logic}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {20:1--20:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.20},
URN = {urn:nbn:de:0030-drops-99190},
doi = {10.4230/LIPIcs.FSTTCS.2018.20},
annote = {Keywords: Partial orders, logic, hyper-logic}
}
@InProceedings{boker_et_al:LIPIcs.FSTTCS.2018.21,
author = {Boker, Udi and Lehtinen, Karoliina},
title = {{On the Way to Alternating Weak Automata}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {21:1--21:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.21},
URN = {urn:nbn:de:0030-drops-99200},
doi = {10.4230/LIPIcs.FSTTCS.2018.21},
annote = {Keywords: Alternating automata, Parity games, Parity automata, Weak automata}
}
@InProceedings{bose_et_al:LIPIcs.FSTTCS.2018.22,
author = {Bose, Sougata and Muscholl, Anca and Penelle, Vincent and Puppis, Gabriele},
title = {{Origin-Equivalence of Two-Way Word Transducers Is in PSPACE}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {22:1--22:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.22},
URN = {urn:nbn:de:0030-drops-99213},
doi = {10.4230/LIPIcs.FSTTCS.2018.22},
annote = {Keywords: Transducers, origin semantics, equivalence}
}
@InProceedings{grover_et_al:LIPIcs.FSTTCS.2018.23,
author = {Grover, Sapna and Gupta, Neelima and Khuller, Samir and Pancholi, Aditya},
title = {{Constant Factor Approximation Algorithm for Uniform Hard Capacitated Knapsack Median Problem}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {23:1--23:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.23},
URN = {urn:nbn:de:0030-drops-99224},
doi = {10.4230/LIPIcs.FSTTCS.2018.23},
annote = {Keywords: Capacitated Knapsack Median, Capacitated k -Facility Location}
}
@InProceedings{bansal_et_al:LIPIcs.FSTTCS.2018.24,
author = {Bansal, Manisha and Garg, Naveen and Gupta, Neelima},
title = {{A 5-Approximation for Universal Facility Location}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {24:1--24:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.24},
URN = {urn:nbn:de:0030-drops-99239},
doi = {10.4230/LIPIcs.FSTTCS.2018.24},
annote = {Keywords: Facility location, Approximation Algorithms, Local Search}
}
@InProceedings{chaudhury_et_al:LIPIcs.FSTTCS.2018.25,
author = {Chaudhury, Bhaskar Ray and Cheung, Yun Kuen and Garg, Jugal and Garg, Naveen and Hoefer, Martin and Mehlhorn, Kurt},
title = {{On Fair Division for Indivisible Items}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {25:1--25:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.25},
URN = {urn:nbn:de:0030-drops-99242},
doi = {10.4230/LIPIcs.FSTTCS.2018.25},
annote = {Keywords: Fair Division, Indivisible Goods, Envy-Free}
}
@InProceedings{chaudhury_et_al:LIPIcs.FSTTCS.2018.26,
author = {Chaudhury, Bhaskar Ray and Mehlhorn, Kurt},
title = {{Combinatorial Algorithms for General Linear Arrow-Debreu Markets}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {26:1--26:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.26},
URN = {urn:nbn:de:0030-drops-99255},
doi = {10.4230/LIPIcs.FSTTCS.2018.26},
annote = {Keywords: Linear Exchange Markets, Equilibrium, Combinatorial Algorithms}
}
@InProceedings{bhaskar_et_al:LIPIcs.FSTTCS.2018.27,
author = {Bhaskar, Umang and Ghosh, Abheek},
title = {{On the Welfare of Cardinal Voting Mechanisms}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {27:1--27:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.27},
URN = {urn:nbn:de:0030-drops-99260},
doi = {10.4230/LIPIcs.FSTTCS.2018.27},
annote = {Keywords: computational social choice, voting rules, cardinal mechanisms, price of anarchy, distortion}
}
@InProceedings{busattogaston_et_al:LIPIcs.FSTTCS.2018.28,
author = {Busatto-Gaston, Damien and Monmege, Benjamin and Reynier, Pierre-Alain},
title = {{Symbolic Approximation of Weighted Timed Games}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {28:1--28:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.28},
URN = {urn:nbn:de:0030-drops-99277},
doi = {10.4230/LIPIcs.FSTTCS.2018.28},
annote = {Keywords: Weighted timed games, Real-time systems, Game theory, Approximation}
}
@InProceedings{debant_et_al:LIPIcs.FSTTCS.2018.29,
author = {Debant, Alexandre and Delaune, St\'{e}phanie and Wiedling, Cyrille},
title = {{A Symbolic Framework to Analyse Physical Proximity in Security Protocols}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {29:1--29:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.29},
URN = {urn:nbn:de:0030-drops-99288},
doi = {10.4230/LIPIcs.FSTTCS.2018.29},
annote = {Keywords: cryptographic protocols, verification, formal methods, process algebra, Dolev-Yao model}
}
@InProceedings{filiot_et_al:LIPIcs.FSTTCS.2018.30,
author = {Filiot, Emmanuel and Gauwin, Olivier and Lhote, Nathan and Muscholl, Anca},
title = {{On Canonical Models for Rational Functions over Infinite Words}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {30:1--30:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.30},
URN = {urn:nbn:de:0030-drops-99295},
doi = {10.4230/LIPIcs.FSTTCS.2018.30},
annote = {Keywords: transducers, infinite words, minimization, aperiodicty, first-order logic}
}
@InProceedings{finkel_et_al:LIPIcs.FSTTCS.2018.31,
author = {Finkel, Alain and Leroux, J\'{e}r\^{o}me and Sutre, Gr\'{e}goire},
title = {{Reachability for Two-Counter Machines with One Test and One Reset}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {31:1--31:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.31},
URN = {urn:nbn:de:0030-drops-99305},
doi = {10.4230/LIPIcs.FSTTCS.2018.31},
annote = {Keywords: Counter machine, Vector addition system, Reachability problem, Formal verification, Presburger arithmetic, Infinite-state system}
}
@InProceedings{ganty_et_al:LIPIcs.FSTTCS.2018.32,
author = {Ganty, Pierre and Guti\'{e}rrez, Elena},
title = {{The Parikh Property for Weighted Context-Free Grammars}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {32:1--32:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.32},
URN = {urn:nbn:de:0030-drops-99315},
doi = {10.4230/LIPIcs.FSTTCS.2018.32},
annote = {Keywords: Weighted Context-Free Grammars, Algebraic Language Theory, Parikh Image}
}
@InProceedings{babay_et_al:LIPIcs.FSTTCS.2018.33,
author = {Babay, Amy and Dinitz, Michael and Zhang, Zeyu},
title = {{Characterizing Demand Graphs for (Fixed-Parameter) Shallow-Light Steiner Network}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {33:1--33:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.33},
URN = {urn:nbn:de:0030-drops-99329},
doi = {10.4230/LIPIcs.FSTTCS.2018.33},
annote = {Keywords: fixed-parameter tractable, network design, shallow-light steiner network, demand graphs}
}
@InProceedings{alambardarmeybodi_et_al:LIPIcs.FSTTCS.2018.34,
author = {Alambardar Meybodi, Mohsen and Fomin, Fedor and Mouawad, Amer E. and Panolan, Fahad},
title = {{On the Parameterized Complexity of \lbrack1,j\rbrack-Domination Problems}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {34:1--34:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.34},
URN = {urn:nbn:de:0030-drops-99330},
doi = {10.4230/LIPIcs.FSTTCS.2018.34},
annote = {Keywords: \lbrack1, j\rbrack-dominating set, parameterized complexity, sparse graphs}
}
@InProceedings{misra_et_al:LIPIcs.FSTTCS.2018.35,
author = {Misra, Pranabendu and Saurabh, Saket and Sharma, Roohani and Zehavi, Meirav},
title = {{Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {35:1--35:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.35},
URN = {urn:nbn:de:0030-drops-99341},
doi = {10.4230/LIPIcs.FSTTCS.2018.35},
annote = {Keywords: sub-exponential fixed-parameter tractable algorithms, directed feedback arc set, directed cutwidth, optimal linear arrangement, bounded independence number digraph}
}
@InProceedings{geeraerts_et_al:LIPIcs.FSTTCS.2018.36,
author = {Geeraerts, Gilles and Guha, Shibashis and Raskin, Jean-Fran\c{c}ois},
title = {{Safe and Optimal Scheduling for Hard and Soft Tasks}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {36:1--36:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.36},
URN = {urn:nbn:de:0030-drops-99352},
doi = {10.4230/LIPIcs.FSTTCS.2018.36},
annote = {Keywords: Non-clairvoyant scheduling, hard and soft tasks, automatic synthesis, Markov decision processes}
}
@InProceedings{honsell_et_al:LIPIcs.FSTTCS.2018.37,
author = {Honsell, Furio and Liquori, Luigi and Stolze, Claude and Scagnetto, Ivan},
title = {{The Delta-Framework}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {37:1--37:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.37},
URN = {urn:nbn:de:0030-drops-99367},
doi = {10.4230/LIPIcs.FSTTCS.2018.37},
annote = {Keywords: Logic of programs, type theory, lambda-calculus}
}
@InProceedings{leroux_et_al:LIPIcs.FSTTCS.2018.38,
author = {Le Roux, St\'{e}phane and Pauly, Arno and Randour, Mickael},
title = {{Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {38:1--38:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.38},
URN = {urn:nbn:de:0030-drops-99373},
doi = {10.4230/LIPIcs.FSTTCS.2018.38},
annote = {Keywords: games on graphs, finite-memory determinacy, multiple objectives}
}
@InProceedings{tirodkar:LIPIcs.FSTTCS.2018.39,
author = {Tirodkar, Sumedh},
title = {{Deterministic Algorithms for Maximum Matching on General Graphs in the Semi-Streaming Model}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {39:1--39:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.39},
URN = {urn:nbn:de:0030-drops-99383},
doi = {10.4230/LIPIcs.FSTTCS.2018.39},
annote = {Keywords: Semi Streaming, Maximum Matching}
}
@InProceedings{bringmann_et_al:LIPIcs.FSTTCS.2018.40,
author = {Bringmann, Karl and Chaudhury, Bhaskar Ray},
title = {{Sketching, Streaming, and Fine-Grained Complexity of (Weighted) LCS}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {40:1--40:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.40},
URN = {urn:nbn:de:0030-drops-99390},
doi = {10.4230/LIPIcs.FSTTCS.2018.40},
annote = {Keywords: algorithms, SETH, communication complexity, run-length encoding}
}
@InProceedings{bauer_et_al:LIPIcs.FSTTCS.2018.41,
author = {Bauer, Balthazar and Vihrovs, Jevgenijs and Wee, Hoeteck},
title = {{On the Inner Product Predicate and a Generalization of Matching Vector Families}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {41:1--41:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.41},
URN = {urn:nbn:de:0030-drops-99400},
doi = {10.4230/LIPIcs.FSTTCS.2018.41},
annote = {Keywords: Predicate Encryption, Inner Product Encoding, Matching Vector Families}
}
@InProceedings{mansutti:LIPIcs.FSTTCS.2018.42,
author = {Mansutti, Alessio},
title = {{Extending Propositional Separation Logic for Robustness Properties}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {42:1--42:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.42},
URN = {urn:nbn:de:0030-drops-99418},
doi = {10.4230/LIPIcs.FSTTCS.2018.42},
annote = {Keywords: Separation logic, decision problems, reachability, logics on trees, interval temporal logic, adjuncts and quantifiers elimination}
}
@InProceedings{padmanabha_et_al:LIPIcs.FSTTCS.2018.43,
author = {Padmanabha, Anantha and Ramanujam, R and Wang, Yanjing},
title = {{Bundled Fragments of First-Order Modal Logic: (Un)Decidability}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {43:1--43:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.43},
URN = {urn:nbn:de:0030-drops-99424},
doi = {10.4230/LIPIcs.FSTTCS.2018.43},
annote = {Keywords: First-order modal logic, decidability, bundled fragments}
}
@InProceedings{penelle_et_al:LIPIcs.FSTTCS.2018.44,
author = {Penelle, Vincent and Salvati, Sylvain and Sutre, Gr\'{e}goire},
title = {{On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {44:1--44:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.44},
URN = {urn:nbn:de:0030-drops-99432},
doi = {10.4230/LIPIcs.FSTTCS.2018.44},
annote = {Keywords: Higher-order pushdown automata, Vector addition systems, Boundedness problem, Termination problem, Coverability problem}
}
@InProceedings{n.prabhakar_et_al:LIPIcs.FSTTCS.2018.45,
author = {N. Prabhakar, Swaroop and Sharma, Vikram},
title = {{Stronger Tradeoffs for Orthogonal Range Querying in the Semigroup Model}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {45:1--45:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.45},
URN = {urn:nbn:de:0030-drops-99440},
doi = {10.4230/LIPIcs.FSTTCS.2018.45},
annote = {Keywords: range querying, lower bounds, matrix factorization, Lagrange dual function}
}
@InProceedings{luo_et_al:LIPIcs.FSTTCS.2018.46,
author = {Luo, Junjie and Molter, Hendrik and Nichterlein, Andr\'{e} and Niedermeier, Rolf},
title = {{Parameterized Dynamic Cluster Editing}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {46:1--46:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.46},
URN = {urn:nbn:de:0030-drops-99450},
doi = {10.4230/LIPIcs.FSTTCS.2018.46},
annote = {Keywords: graph-based data clustering, goal-oriented clustering, compromise clustering, NP-hard problems, fixed-parameter tractability, parameterized hardness}
}
@InProceedings{place_et_al:LIPIcs.FSTTCS.2018.47,
author = {Place, Thomas and Zeitoun, Marc},
title = {{The Complexity of Separation for Levels in Concatenation Hierarchies}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {47:1--47:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.47},
URN = {urn:nbn:de:0030-drops-99463},
doi = {10.4230/LIPIcs.FSTTCS.2018.47},
annote = {Keywords: Regular languages, separation, concatenation hierarchies, complexity}
}
@InProceedings{boiret_et_al:LIPIcs.FSTTCS.2018.48,
author = {Boiret, Adrien and Pi\'{o}rkowski, Radoslaw and Schmude, Janusz},
title = {{Reducing Transducer Equivalence to Register Automata Problems Solved by "Hilbert Method"}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {48:1--48:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.48},
URN = {urn:nbn:de:0030-drops-99479},
doi = {10.4230/LIPIcs.FSTTCS.2018.48},
annote = {Keywords: formal language, Hilbert's basis theorem, transducers, register automata, equivalence problem, unordered trees, MSO transformations}
}
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