@Proceedings{chattopadhyay_et_al:LIPIcs.FSTTCS.2019,
title = {{LIPIcs, Volume 150, FSTTCS'19, Complete Volume}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019},
URN = {urn:nbn:de:0030-drops-116426},
doi = {10.4230/LIPIcs.FSTTCS.2019},
annote = {Keywords: Theory of computation}
}
@InProceedings{chattopadhyay_et_al:LIPIcs.FSTTCS.2019.0,
author = {Chattopadhyay, Arkadev and Gastin, Paul},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {0:i--0:xii},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.0},
URN = {urn:nbn:de:0030-drops-115621},
doi = {10.4230/LIPIcs.FSTTCS.2019.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{bhargavan_et_al:LIPIcs.FSTTCS.2019.1,
author = {Bhargavan, Karthikeyan and Naldurg, Prasad},
title = {{Practical Formal Methods for Real World Cryptography}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {1:1--1:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.1},
URN = {urn:nbn:de:0030-drops-115632},
doi = {10.4230/LIPIcs.FSTTCS.2019.1},
annote = {Keywords: Formal verification, Applied cryptography, Security protocols, Machine learning}
}
@InProceedings{krauthgamer:LIPIcs.FSTTCS.2019.2,
author = {Krauthgamer, Robert},
title = {{Sketching Graphs and Combinatorial Optimization}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {2:1--2:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.2},
URN = {urn:nbn:de:0030-drops-115646},
doi = {10.4230/LIPIcs.FSTTCS.2019.2},
annote = {Keywords: Sketching, edge sparsification, vertex sparsification, Gomory-Hu tree, mimicking networks, graph sampling, succinct data structures}
}
@InProceedings{lazic:LIPIcs.FSTTCS.2019.3,
author = {Lazi\'{c}, Ranko},
title = {{Finkel Was Right: Counter-Examples to Several Conjectures on Variants of Vector Addition Systems}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {3:1--3:2},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.3},
URN = {urn:nbn:de:0030-drops-115653},
doi = {10.4230/LIPIcs.FSTTCS.2019.3},
annote = {Keywords: Petri nets, vector addition systems, reachability}
}
@InProceedings{pitassi:LIPIcs.FSTTCS.2019.4,
author = {Pitassi, Toniann},
title = {{Progress in Lifting and Applications in Lower Bounds}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {4:1--4:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.4},
URN = {urn:nbn:de:0030-drops-115664},
doi = {10.4230/LIPIcs.FSTTCS.2019.4},
annote = {Keywords: complexity theory, lower bounds, communication complexity}
}
@InProceedings{roughgarden:LIPIcs.FSTTCS.2019.5,
author = {Roughgarden, Tim},
title = {{How Computer Science Informs Modern Auction Design}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {5:1--5:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.5},
URN = {urn:nbn:de:0030-drops-115678},
doi = {10.4230/LIPIcs.FSTTCS.2019.5},
annote = {Keywords: Game Theory, Auction Design, Algorithms}
}
@InProceedings{silva:LIPIcs.FSTTCS.2019.6,
author = {Silva, Alexandra},
title = {{An Algebraic Framework to Reason About Concurrency}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {6:1--6:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.6},
URN = {urn:nbn:de:0030-drops-115687},
doi = {10.4230/LIPIcs.FSTTCS.2019.6},
annote = {Keywords: Kleene Algebra, Concurrency, Automata}
}
@InProceedings{adler_et_al:LIPIcs.FSTTCS.2019.7,
author = {Adler, Isolde and Paul, Christophe and Thilikos, Dimitrios M.},
title = {{Connected Search for a Lazy Robber}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {7:1--7:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.7},
URN = {urn:nbn:de:0030-drops-115695},
doi = {10.4230/LIPIcs.FSTTCS.2019.7},
annote = {Keywords: Graph searching, Tree-decomposition, Obstructions}
}
@InProceedings{agrawal_et_al:LIPIcs.FSTTCS.2019.8,
author = {Agrawal, Akanksha and Biswas, Arindam and Bonnet, \'{E}douard and Brettell, Nick and Curticapean, Radu and Marx, D\'{a}niel and Miltzow, Tillmann and Raman, Venkatesh and Saurabh, Saket},
title = {{Parameterized Streaming Algorithms for Min-Ones d-SAT}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {8:1--8:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.8},
URN = {urn:nbn:de:0030-drops-115708},
doi = {10.4230/LIPIcs.FSTTCS.2019.8},
annote = {Keywords: min, ones, sat, d-sat, parameterized, kernelization, streaming, space, efficient, algorithm, parameter}
}
@InProceedings{arvind_et_al:LIPIcs.FSTTCS.2019.9,
author = {Arvind, V. and Chatterjee, Abhranil and Datta, Rajit and Mukhopadhyay, Partha},
title = {{Fast Exact Algorithms Using Hadamard Product of Polynomials}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {9:1--9:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.9},
URN = {urn:nbn:de:0030-drops-115711},
doi = {10.4230/LIPIcs.FSTTCS.2019.9},
annote = {Keywords: Hadamard Product, Multilinear Monomial Detection and Counting, Rectangular Permanent, Symmetric Polynomial}
}
@InProceedings{chakraborty_et_al:LIPIcs.FSTTCS.2019.10,
author = {Chakraborty, Diptarka and Das, Debarati and Kouck\'{y}, Michal},
title = {{Approximate Online Pattern Matching in Sublinear Time}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {10:1--10:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.10},
URN = {urn:nbn:de:0030-drops-115726},
doi = {10.4230/LIPIcs.FSTTCS.2019.10},
annote = {Keywords: Approximate Pattern Matching, Online Pattern Matching, Edit Distance, Sublinear Algorithm, Streaming Algorithm}
}
@InProceedings{chatterjee_et_al:LIPIcs.FSTTCS.2019.11,
author = {Chatterjee, Prerona and Saptharishi, Ramprasad},
title = {{Constructing Faithful Homomorphisms over Fields of Finite Characteristic}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {11:1--11:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.11},
URN = {urn:nbn:de:0030-drops-115733},
doi = {10.4230/LIPIcs.FSTTCS.2019.11},
annote = {Keywords: Faithful Homomorphisms, Identity Testing, Algebraic Independence, Finite characteristic fields}
}
@InProceedings{choi_et_al:LIPIcs.FSTTCS.2019.12,
author = {Choi, Yujin and Lee, Seungjun and Ahn, Hee-Kap},
title = {{Maximum-Area Rectangles in a Simple Polygon}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {12:1--12:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.12},
URN = {urn:nbn:de:0030-drops-115745},
doi = {10.4230/LIPIcs.FSTTCS.2019.12},
annote = {Keywords: Maximum-area rectangle, largest rectangle, simple polygon}
}
@InProceedings{dreier_et_al:LIPIcs.FSTTCS.2019.13,
author = {Dreier, Jan and Rossmanith, Peter},
title = {{Motif Counting in Preferential Attachment Graphs}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {13:1--13:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.13},
URN = {urn:nbn:de:0030-drops-115750},
doi = {10.4230/LIPIcs.FSTTCS.2019.13},
annote = {Keywords: random graphs, motif counting, average case analysis, preferential attachment graphs}
}
@InProceedings{fomin_et_al:LIPIcs.FSTTCS.2019.14,
author = {Fomin, Fedor V. and Golovach, Petr A. and Simonov, Kirill},
title = {{Parameterized k-Clustering: Tractability Island}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {14:1--14:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.14},
URN = {urn:nbn:de:0030-drops-115761},
doi = {10.4230/LIPIcs.FSTTCS.2019.14},
annote = {Keywords: clustering, parameterized complexity, k-means, k-median}
}
@InProceedings{fournier_et_al:LIPIcs.FSTTCS.2019.15,
author = {Fournier, Herv\'{e} and Malod, Guillaume and Szusterman, Maud and Tavenas, S\'{e}bastien},
title = {{Nonnegative Rank Measures and Monotone Algebraic Branching Programs}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {15:1--15:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.15},
URN = {urn:nbn:de:0030-drops-115774},
doi = {10.4230/LIPIcs.FSTTCS.2019.15},
annote = {Keywords: Elementary symmetric polynomials, lower bounds}
}
@InProceedings{gupta_et_al:LIPIcs.FSTTCS.2019.16,
author = {Gupta, Chetan and Jain, Rahul and Sharma, Vimal Raj and Tewari, Raghunath},
title = {{Unambiguous Catalytic Computation}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {16:1--16:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.16},
URN = {urn:nbn:de:0030-drops-115782},
doi = {10.4230/LIPIcs.FSTTCS.2019.16},
annote = {Keywords: Catalytic computation, Logspace, Reinhardt-Allender}
}
@InProceedings{hoi_et_al:LIPIcs.FSTTCS.2019.17,
author = {Hoi, Gordon and Jain, Sanjay and Stephan, Frank},
title = {{A Fast Exponential Time Algorithm for Max Hamming Distance X3SAT}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {17:1--17:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.17},
URN = {urn:nbn:de:0030-drops-115799},
doi = {10.4230/LIPIcs.FSTTCS.2019.17},
annote = {Keywords: X3SAT Problem, Maximum Hamming Distance of Solutions, Exponential Time Algorithms, DPLL Algorithms}
}
@InProceedings{jain_et_al:LIPIcs.FSTTCS.2019.18,
author = {Jain, Pallavi and Kanesh, Lawqueen and Lochet, William and Saurabh, Saket and Sharma, Roohani},
title = {{Exact and Approximate Digraph Bandwidth}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {18:1--18:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.18},
URN = {urn:nbn:de:0030-drops-115802},
doi = {10.4230/LIPIcs.FSTTCS.2019.18},
annote = {Keywords: directed bandwidth, digraph bandwidth, approximation scheme, exact exponential algorithms}
}
@InProceedings{jain_et_al:LIPIcs.FSTTCS.2019.19,
author = {Jain, Rahul and Tewari, Raghunath},
title = {{An O(n^(1/4 +epsilon)) Space and Polynomial Algorithm for Grid Graph Reachability}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {19:1--19:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.19},
URN = {urn:nbn:de:0030-drops-115813},
doi = {10.4230/LIPIcs.FSTTCS.2019.19},
annote = {Keywords: graph reachability, grid graph, graph algorithm, sublinear space algorithm}
}
@InProceedings{kavitha:LIPIcs.FSTTCS.2019.20,
author = {Kavitha, Telikepalli},
title = {{Popular Roommates in Simply Exponential Time}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {20:1--20:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.20},
URN = {urn:nbn:de:0030-drops-115820},
doi = {10.4230/LIPIcs.FSTTCS.2019.20},
annote = {Keywords: Roommates instance, Popular matching, Stable matching, Dual certificate}
}
@InProceedings{kolisetty_et_al:LIPIcs.FSTTCS.2019.21,
author = {Kolisetty, Sanjana and Le, Linh and Volkovich, Ilya and Yannakakis, Mihalis},
title = {{The Complexity of Finding S-Factors in Regular Graphs}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {21:1--21:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.21},
URN = {urn:nbn:de:0030-drops-115834},
doi = {10.4230/LIPIcs.FSTTCS.2019.21},
annote = {Keywords: constraint satisfaction problem, Dichotomy theorem, Graph Factors, Regular Graphs}
}
@InProceedings{limaye_et_al:LIPIcs.FSTTCS.2019.22,
author = {Limaye, Nutan and Srinivasan, Srikanth and Tripathi, Utkarsh},
title = {{More on AC^0\lbrackoplus\rbrack and Variants of the Majority Function}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {22:1--22:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.22},
URN = {urn:nbn:de:0030-drops-115844},
doi = {10.4230/LIPIcs.FSTTCS.2019.22},
annote = {Keywords: AC^0\lbrackoplus\rbrack, Coin Problem, Promise Majority}
}
@InProceedings{louis_et_al:LIPIcs.FSTTCS.2019.23,
author = {Louis, Anand and Venkat, Rakesh},
title = {{Planted Models for k-Way Edge and Vertex Expansion}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {23:1--23:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.23},
URN = {urn:nbn:de:0030-drops-115857},
doi = {10.4230/LIPIcs.FSTTCS.2019.23},
annote = {Keywords: Vertex Expansion, k-way partitioning, Semi-Random models, Planted Models, Approximation Algorithms, Beyond Worst Case Analysis}
}
@InProceedings{lucarelli_et_al:LIPIcs.FSTTCS.2019.24,
author = {Lucarelli, Giorgio and Moseley, Benjamin and Thang, Nguyen Kim and Srivastav, Abhinav and Trystram, Denis},
title = {{Online Non-Preemptive Scheduling to Minimize Maximum Weighted Flow-Time on Related Machines}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {24:1--24:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.24},
URN = {urn:nbn:de:0030-drops-115867},
doi = {10.4230/LIPIcs.FSTTCS.2019.24},
annote = {Keywords: Online Algorithms, Scheduling, Resource Augmentation}
}
@InProceedings{potukuchi:LIPIcs.FSTTCS.2019.25,
author = {Potukuchi, Aditya},
title = {{On the AC^0\lbrackoplus\rbrack Complexity of Andreev’s Problem}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {25:1--25:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.25},
URN = {urn:nbn:de:0030-drops-115879},
doi = {10.4230/LIPIcs.FSTTCS.2019.25},
annote = {Keywords: List Recovery, Sharp Threshold, Fourier Analysis}
}
@InProceedings{sarpatwar_et_al:LIPIcs.FSTTCS.2019.26,
author = {Sarpatwar, Kanthi and Schieber, Baruch and Shachnai, Hadas},
title = {{The Preemptive Resource Allocation Problem}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {26:1--26:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.26},
URN = {urn:nbn:de:0030-drops-115886},
doi = {10.4230/LIPIcs.FSTTCS.2019.26},
annote = {Keywords: Machine Scheduling, Resource Allocation, Vector Packing, Approximation Algorithms}
}
@InProceedings{schwartz_et_al:LIPIcs.FSTTCS.2019.27,
author = {Schwartz, Roy and Singh, Mohit and Yazdanbod, Sina},
title = {{Online and Offline Algorithms for Circuit Switch Scheduling}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {27:1--27:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.27},
URN = {urn:nbn:de:0030-drops-115893},
doi = {10.4230/LIPIcs.FSTTCS.2019.27},
annote = {Keywords: approximation algorithm, online, matching, scheduling}
}
@InProceedings{srinivasan_et_al:LIPIcs.FSTTCS.2019.28,
author = {Srinivasan, Srikanth and Tripathi, Utkarsh and Venkitesh, S.},
title = {{On the Probabilistic Degrees of Symmetric Boolean Functions}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {28:1--28:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.28},
URN = {urn:nbn:de:0030-drops-115908},
doi = {10.4230/LIPIcs.FSTTCS.2019.28},
annote = {Keywords: Symmetric Boolean function, probabilistic degree}
}
@InProceedings{akshay_et_al:LIPIcs.FSTTCS.2019.29,
author = {Akshay, S. and Bazille, Hugo and Fabre, Eric and Genest, Blaise},
title = {{Classification Among Hidden Markov Models}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {29:1--29:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.29},
URN = {urn:nbn:de:0030-drops-115917},
doi = {10.4230/LIPIcs.FSTTCS.2019.29},
annote = {Keywords: verification: probabilistic systems, partially observable systems}
}
@InProceedings{baldan_et_al:LIPIcs.FSTTCS.2019.30,
author = {Baldan, Paolo and Raffaet\`{a}, Alessandra},
title = {{Minimisation of Event Structures}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {30:1--30:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.30},
URN = {urn:nbn:de:0030-drops-115923},
doi = {10.4230/LIPIcs.FSTTCS.2019.30},
annote = {Keywords: Event structures, minimisation, history-preserving bisimilarity, behaviour-preserving quotient}
}
@InProceedings{bertrand_et_al:LIPIcs.FSTTCS.2019.31,
author = {Bertrand, Nathalie and Bouyer, Patricia and Majumdar, Anirban},
title = {{Concurrent Parameterized Games}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {31:1--31:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.31},
URN = {urn:nbn:de:0030-drops-115931},
doi = {10.4230/LIPIcs.FSTTCS.2019.31},
annote = {Keywords: concurrent games, parameterized verification}
}
@InProceedings{bordais_et_al:LIPIcs.FSTTCS.2019.32,
author = {Bordais, Benjamin and Guha, Shibashis and Raskin, Jean-Fran\c{c}ois},
title = {{Expected Window Mean-Payoff}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {32:1--32:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.32},
URN = {urn:nbn:de:0030-drops-115940},
doi = {10.4230/LIPIcs.FSTTCS.2019.32},
annote = {Keywords: mean-payoff, Markov decision processes, synthesis}
}
@InProceedings{bozzelli_et_al:LIPIcs.FSTTCS.2019.33,
author = {Bozzelli, Laura and Montanari, Angelo and Peron, Adriano},
title = {{Interval Temporal Logic for Visibly Pushdown Systems}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {33:1--33:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.33},
URN = {urn:nbn:de:0030-drops-115959},
doi = {10.4230/LIPIcs.FSTTCS.2019.33},
annote = {Keywords: Pushdown systems, Interval temporal logic, Model checking}
}
@InProceedings{bozzelli_et_al:LIPIcs.FSTTCS.2019.34,
author = {Bozzelli, Laura and Montanari, Angelo and Peron, Adriano},
title = {{Taming the Complexity of Timeline-Based Planning over Dense Temporal Domains}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {34:1--34:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.34},
URN = {urn:nbn:de:0030-drops-115963},
doi = {10.4230/LIPIcs.FSTTCS.2019.34},
annote = {Keywords: Timeline-based planning, timed automata, event-clock automata}
}
@InProceedings{brihaye_et_al:LIPIcs.FSTTCS.2019.35,
author = {Brihaye, Thomas and Geeraerts, Gilles and Hallet, Marion and Monmege, Benjamin and Quoitin, Bruno},
title = {{Dynamics on Games: Simulation-Based Techniques and Applications to Routing}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {35:1--35:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.35},
URN = {urn:nbn:de:0030-drops-115978},
doi = {10.4230/LIPIcs.FSTTCS.2019.35},
annote = {Keywords: games on graphs, dynamics, simulation, network}
}
@InProceedings{chattopadhyay_et_al:LIPIcs.FSTTCS.2019.36,
author = {Chattopadhyay, Agnishom and Praveen, M.},
title = {{Query Preserving Watermarking Schemes for Locally Treelike Databases}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {36:1--36:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.36},
URN = {urn:nbn:de:0030-drops-115988},
doi = {10.4230/LIPIcs.FSTTCS.2019.36},
annote = {Keywords: Locally bounded tree-width, closure under minors, first-order queries, watermarking}
}
@InProceedings{chini_et_al:LIPIcs.FSTTCS.2019.37,
author = {Chini, Peter and Meyer, Roland and Saivasan, Prakash},
title = {{Complexity of Liveness in Parameterized Systems}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {37:1--37:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.37},
URN = {urn:nbn:de:0030-drops-115993},
doi = {10.4230/LIPIcs.FSTTCS.2019.37},
annote = {Keywords: Liveness Verification, Fine-Grained Complexity, Parameterized Systems}
}
@InProceedings{droste_et_al:LIPIcs.FSTTCS.2019.38,
author = {Droste, Manfred and Dziadek, Sven and Kuich, Werner},
title = {{Greibach Normal Form for omega-Algebraic Systems and Weighted Simple omega-Pushdown Automata}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {38:1--38:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.38},
URN = {urn:nbn:de:0030-drops-116003},
doi = {10.4230/LIPIcs.FSTTCS.2019.38},
annote = {Keywords: Weighted omega-Context-Free Grammars, Algebraic Systems, Greibach Normal Form, Weighted Automata, omega-Pushdown Automata}
}
@InProceedings{dudek_et_al:LIPIcs.FSTTCS.2019.39,
author = {Dudek, Jeffrey M. and Fried, Dror},
title = {{Transformations of Boolean Functions}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {39:1--39:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.39},
URN = {urn:nbn:de:0030-drops-116019},
doi = {10.4230/LIPIcs.FSTTCS.2019.39},
annote = {Keywords: Boolean Formulas, Boolean Functions, Transformations, Model Counting}
}
@InProceedings{filiot_et_al:LIPIcs.FSTTCS.2019.40,
author = {Filiot, Emmanuel and Guha, Shibashis and Mazzocchi, Nicolas},
title = {{Two-Way Parikh Automata}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {40:1--40:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.40},
URN = {urn:nbn:de:0030-drops-116027},
doi = {10.4230/LIPIcs.FSTTCS.2019.40},
annote = {Keywords: Parikh automata, two-way automata, Presburger arithmetic}
}
@InProceedings{finkel_et_al:LIPIcs.FSTTCS.2019.41,
author = {Finkel, Alain and Gupta, Ekanshdeep},
title = {{The Well Structured Problem for Presburger Counter Machines}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {41:1--41:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.41},
URN = {urn:nbn:de:0030-drops-116037},
doi = {10.4230/LIPIcs.FSTTCS.2019.41},
annote = {Keywords: Well structured transition systems, infinite state systems, Presburger counter machines, reachability, coverability}
}
@InProceedings{gadducci_et_al:LIPIcs.FSTTCS.2019.42,
author = {Gadducci, Fabio and Melgratti, Hern\'{a}n and Rold\'{a}n, Christian and Sammartino, Matteo},
title = {{A Categorical Account of Replicated Data Types}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {42:1--42:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.42},
URN = {urn:nbn:de:0030-drops-116042},
doi = {10.4230/LIPIcs.FSTTCS.2019.42},
annote = {Keywords: Replicated data type, Specification, Functorial characterisation}
}
@InProceedings{kleinebuning_et_al:LIPIcs.FSTTCS.2019.43,
author = {Kleine B\"{u}ning, Hans and Wojciechowski, Piotr and Subramani, K.},
title = {{New Results on Cutting Plane Proofs for Horn Constraint Systems}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {43:1--43:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.43},
URN = {urn:nbn:de:0030-drops-116056},
doi = {10.4230/LIPIcs.FSTTCS.2019.43},
annote = {Keywords: Horn constraints, cutting planes, proof length}
}
@InProceedings{kuhlmann_et_al:LIPIcs.FSTTCS.2019.44,
author = {Kuhlmann, Marco and Maletti, Andreas and Schiffer, Lena Katharina},
title = {{The Tree-Generative Capacity of Combinatory Categorial Grammars}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {44:1--44:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.44},
URN = {urn:nbn:de:0030-drops-116063},
doi = {10.4230/LIPIcs.FSTTCS.2019.44},
annote = {Keywords: Combinatory Categorial Grammar, Regular Tree Language, Linear Context-free Tree Language}
}
@InProceedings{kuperberg_et_al:LIPIcs.FSTTCS.2019.45,
author = {Kuperberg, Denis and Pinault, Laureline and Pous, Damien},
title = {{Cyclic Proofs and Jumping Automata}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {45:1--45:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.45},
URN = {urn:nbn:de:0030-drops-116071},
doi = {10.4230/LIPIcs.FSTTCS.2019.45},
annote = {Keywords: Cyclic proofs, regular languages, multi-head automata, transducers}
}
@InProceedings{latorre_et_al:LIPIcs.FSTTCS.2019.46,
author = {La Torre, Salvatore and Parthasarathy, Madhusudan},
title = {{Reachability in Concurrent Uninterpreted Programs}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {46:1--46:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.46},
URN = {urn:nbn:de:0030-drops-116082},
doi = {10.4230/LIPIcs.FSTTCS.2019.46},
annote = {Keywords: Verification, uninterpreted programs, concurrent programs, shared memory}
}
@InProceedings{leroux:LIPIcs.FSTTCS.2019.47,
author = {Leroux, J\'{e}r\^{o}me},
title = {{Distance Between Mutually Reachable Petri Net Configurations}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {47:1--47:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.47},
URN = {urn:nbn:de:0030-drops-116094},
doi = {10.4230/LIPIcs.FSTTCS.2019.47},
annote = {Keywords: Petri nets, Vector addition systems, Formal verification, Reachability problem}
}
@InProceedings{mansard:LIPIcs.FSTTCS.2019.48,
author = {Mansard, Alexandre},
title = {{Boolean Algebras from Trace Automata}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {48:1--48:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.48},
URN = {urn:nbn:de:0030-drops-116107},
doi = {10.4230/LIPIcs.FSTTCS.2019.48},
annote = {Keywords: Boolean algebras, traces, automata, synchronization, pushdown automata, vector addition systems}
}
@InProceedings{mestel:LIPIcs.FSTTCS.2019.49,
author = {Mestel, David},
title = {{Widths of Regular and Context-Free Languages}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {49:1--49:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.49},
URN = {urn:nbn:de:0030-drops-116111},
doi = {10.4230/LIPIcs.FSTTCS.2019.49},
annote = {Keywords: Formal languages, combinatorics on words, information flow}
}
@InProceedings{rabinovich_et_al:LIPIcs.FSTTCS.2019.50,
author = {Rabinovich, Alexander and Tiferet, Doron},
title = {{Degrees of Ambiguity of B\"{u}chi Tree Automata}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {50:1--50:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.50},
URN = {urn:nbn:de:0030-drops-116122},
doi = {10.4230/LIPIcs.FSTTCS.2019.50},
annote = {Keywords: automata on infinite trees, ambiguous automata}
}
@InProceedings{thinniyam_et_al:LIPIcs.FSTTCS.2019.51,
author = {Thinniyam, Ramanathan S. and Zetzsche, Georg},
title = {{Regular Separability and Intersection Emptiness Are Independent Problems}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {51:1--51:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.51},
URN = {urn:nbn:de:0030-drops-116138},
doi = {10.4230/LIPIcs.FSTTCS.2019.51},
annote = {Keywords: Regular separability, intersection emptiness, decidability}
}
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