<h2>LIPIcs, Volume 150, FSTTCS 2019</h2>
<ul>
<li>
<span class="authors">Arkadev Chattopadhyay and Paul Gastin</span>
<span class="title">LIPIcs, Volume 150, FSTTCS'19, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019">10.4230/LIPIcs.FSTTCS.2019</a>
</li>
<li>
<span class="authors">Arkadev Chattopadhyay and Paul Gastin</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.0">10.4230/LIPIcs.FSTTCS.2019.0</a>
</li>
<li>
<span class="authors">Karthikeyan Bhargavan and Prasad Naldurg</span>
<span class="title">Practical Formal Methods for Real World Cryptography (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.1">10.4230/LIPIcs.FSTTCS.2019.1</a>
</li>
<li>
<span class="authors">Robert Krauthgamer</span>
<span class="title">Sketching Graphs and Combinatorial Optimization (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.2">10.4230/LIPIcs.FSTTCS.2019.2</a>
</li>
<li>
<span class="authors">Ranko Lazić</span>
<span class="title">Finkel Was Right: Counter-Examples to Several Conjectures on Variants of Vector Addition Systems (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.3">10.4230/LIPIcs.FSTTCS.2019.3</a>
</li>
<li>
<span class="authors">Toniann Pitassi</span>
<span class="title">Progress in Lifting and Applications in Lower Bounds (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.4">10.4230/LIPIcs.FSTTCS.2019.4</a>
</li>
<li>
<span class="authors">Tim Roughgarden</span>
<span class="title">How Computer Science Informs Modern Auction Design (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.5">10.4230/LIPIcs.FSTTCS.2019.5</a>
</li>
<li>
<span class="authors">Alexandra Silva</span>
<span class="title">An Algebraic Framework to Reason About Concurrency (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.6">10.4230/LIPIcs.FSTTCS.2019.6</a>
</li>
<li>
<span class="authors">Isolde Adler, Christophe Paul, and Dimitrios M. Thilikos</span>
<span class="title">Connected Search for a Lazy Robber</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.7">10.4230/LIPIcs.FSTTCS.2019.7</a>
</li>
<li>
<span class="authors">Akanksha Agrawal, Arindam Biswas, Édouard Bonnet, Nick Brettell, Radu Curticapean, Dániel Marx, Tillmann Miltzow, Venkatesh Raman, and Saket Saurabh</span>
<span class="title">Parameterized Streaming Algorithms for Min-Ones d-SAT</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.8">10.4230/LIPIcs.FSTTCS.2019.8</a>
</li>
<li>
<span class="authors">V. Arvind, Abhranil Chatterjee, Rajit Datta, and Partha Mukhopadhyay</span>
<span class="title">Fast Exact Algorithms Using Hadamard Product of Polynomials</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.9">10.4230/LIPIcs.FSTTCS.2019.9</a>
</li>
<li>
<span class="authors">Diptarka Chakraborty, Debarati Das, and Michal Koucký</span>
<span class="title">Approximate Online Pattern Matching in Sublinear Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.10">10.4230/LIPIcs.FSTTCS.2019.10</a>
</li>
<li>
<span class="authors">Prerona Chatterjee and Ramprasad Saptharishi</span>
<span class="title">Constructing Faithful Homomorphisms over Fields of Finite Characteristic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.11">10.4230/LIPIcs.FSTTCS.2019.11</a>
</li>
<li>
<span class="authors">Yujin Choi, Seungjun Lee, and Hee-Kap Ahn</span>
<span class="title">Maximum-Area Rectangles in a Simple Polygon</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.12">10.4230/LIPIcs.FSTTCS.2019.12</a>
</li>
<li>
<span class="authors">Jan Dreier and Peter Rossmanith</span>
<span class="title">Motif Counting in Preferential Attachment Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.13">10.4230/LIPIcs.FSTTCS.2019.13</a>
</li>
<li>
<span class="authors">Fedor V. Fomin, Petr A. Golovach, and Kirill Simonov</span>
<span class="title">Parameterized k-Clustering: Tractability Island</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.14">10.4230/LIPIcs.FSTTCS.2019.14</a>
</li>
<li>
<span class="authors">Hervé Fournier, Guillaume Malod, Maud Szusterman, and Sébastien Tavenas</span>
<span class="title">Nonnegative Rank Measures and Monotone Algebraic Branching Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.15">10.4230/LIPIcs.FSTTCS.2019.15</a>
</li>
<li>
<span class="authors">Chetan Gupta, Rahul Jain, Vimal Raj Sharma, and Raghunath Tewari</span>
<span class="title">Unambiguous Catalytic Computation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.16">10.4230/LIPIcs.FSTTCS.2019.16</a>
</li>
<li>
<span class="authors">Gordon Hoi, Sanjay Jain, and Frank Stephan</span>
<span class="title">A Fast Exponential Time Algorithm for Max Hamming Distance X3SAT</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.17">10.4230/LIPIcs.FSTTCS.2019.17</a>
</li>
<li>
<span class="authors">Pallavi Jain, Lawqueen Kanesh, William Lochet, Saket Saurabh, and Roohani Sharma</span>
<span class="title">Exact and Approximate Digraph Bandwidth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.18">10.4230/LIPIcs.FSTTCS.2019.18</a>
</li>
<li>
<span class="authors">Rahul Jain and Raghunath Tewari</span>
<span class="title">An O(n^(1/4 +epsilon)) Space and Polynomial Algorithm for Grid Graph Reachability</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.19">10.4230/LIPIcs.FSTTCS.2019.19</a>
</li>
<li>
<span class="authors">Telikepalli Kavitha</span>
<span class="title">Popular Roommates in Simply Exponential Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.20">10.4230/LIPIcs.FSTTCS.2019.20</a>
</li>
<li>
<span class="authors">Sanjana Kolisetty, Linh Le, Ilya Volkovich, and Mihalis Yannakakis</span>
<span class="title">The Complexity of Finding S-Factors in Regular Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.21">10.4230/LIPIcs.FSTTCS.2019.21</a>
</li>
<li>
<span class="authors">Nutan Limaye, Srikanth Srinivasan, and Utkarsh Tripathi</span>
<span class="title">More on AC^0[oplus] and Variants of the Majority Function</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.22">10.4230/LIPIcs.FSTTCS.2019.22</a>
</li>
<li>
<span class="authors">Anand Louis and Rakesh Venkat</span>
<span class="title">Planted Models for k-Way Edge and Vertex Expansion</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.23">10.4230/LIPIcs.FSTTCS.2019.23</a>
</li>
<li>
<span class="authors">Giorgio Lucarelli, Benjamin Moseley, Nguyen Kim Thang, Abhinav Srivastav, and Denis Trystram</span>
<span class="title">Online Non-Preemptive Scheduling to Minimize Maximum Weighted Flow-Time on Related Machines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.24">10.4230/LIPIcs.FSTTCS.2019.24</a>
</li>
<li>
<span class="authors">Aditya Potukuchi</span>
<span class="title">On the AC^0[oplus] Complexity of Andreev’s Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.25">10.4230/LIPIcs.FSTTCS.2019.25</a>
</li>
<li>
<span class="authors">Kanthi Sarpatwar, Baruch Schieber, and Hadas Shachnai</span>
<span class="title">The Preemptive Resource Allocation Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.26">10.4230/LIPIcs.FSTTCS.2019.26</a>
</li>
<li>
<span class="authors">Roy Schwartz, Mohit Singh, and Sina Yazdanbod</span>
<span class="title">Online and Offline Algorithms for Circuit Switch Scheduling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.27">10.4230/LIPIcs.FSTTCS.2019.27</a>
</li>
<li>
<span class="authors">Srikanth Srinivasan, Utkarsh Tripathi, and S. Venkitesh</span>
<span class="title">On the Probabilistic Degrees of Symmetric Boolean Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.28">10.4230/LIPIcs.FSTTCS.2019.28</a>
</li>
<li>
<span class="authors">S. Akshay, Hugo Bazille, Eric Fabre, and Blaise Genest</span>
<span class="title">Classification Among Hidden Markov Models</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.29">10.4230/LIPIcs.FSTTCS.2019.29</a>
</li>
<li>
<span class="authors">Paolo Baldan and Alessandra Raffaetà</span>
<span class="title">Minimisation of Event Structures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.30">10.4230/LIPIcs.FSTTCS.2019.30</a>
</li>
<li>
<span class="authors">Nathalie Bertrand, Patricia Bouyer, and Anirban Majumdar</span>
<span class="title">Concurrent Parameterized Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.31">10.4230/LIPIcs.FSTTCS.2019.31</a>
</li>
<li>
<span class="authors">Benjamin Bordais, Shibashis Guha, and Jean-François Raskin</span>
<span class="title">Expected Window Mean-Payoff</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.32">10.4230/LIPIcs.FSTTCS.2019.32</a>
</li>
<li>
<span class="authors">Laura Bozzelli, Angelo Montanari, and Adriano Peron</span>
<span class="title">Interval Temporal Logic for Visibly Pushdown Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.33">10.4230/LIPIcs.FSTTCS.2019.33</a>
</li>
<li>
<span class="authors">Laura Bozzelli, Angelo Montanari, and Adriano Peron</span>
<span class="title">Taming the Complexity of Timeline-Based Planning over Dense Temporal Domains</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.34">10.4230/LIPIcs.FSTTCS.2019.34</a>
</li>
<li>
<span class="authors">Thomas Brihaye, Gilles Geeraerts, Marion Hallet, Benjamin Monmege, and Bruno Quoitin</span>
<span class="title">Dynamics on Games: Simulation-Based Techniques and Applications to Routing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.35">10.4230/LIPIcs.FSTTCS.2019.35</a>
</li>
<li>
<span class="authors">Agnishom Chattopadhyay and M. Praveen</span>
<span class="title">Query Preserving Watermarking Schemes for Locally Treelike Databases</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.36">10.4230/LIPIcs.FSTTCS.2019.36</a>
</li>
<li>
<span class="authors">Peter Chini, Roland Meyer, and Prakash Saivasan</span>
<span class="title">Complexity of Liveness in Parameterized Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.37">10.4230/LIPIcs.FSTTCS.2019.37</a>
</li>
<li>
<span class="authors">Manfred Droste, Sven Dziadek, and Werner Kuich</span>
<span class="title">Greibach Normal Form for omega-Algebraic Systems and Weighted Simple omega-Pushdown Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.38">10.4230/LIPIcs.FSTTCS.2019.38</a>
</li>
<li>
<span class="authors">Jeffrey M. Dudek and Dror Fried</span>
<span class="title">Transformations of Boolean Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.39">10.4230/LIPIcs.FSTTCS.2019.39</a>
</li>
<li>
<span class="authors">Emmanuel Filiot, Shibashis Guha, and Nicolas Mazzocchi</span>
<span class="title">Two-Way Parikh Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.40">10.4230/LIPIcs.FSTTCS.2019.40</a>
</li>
<li>
<span class="authors">Alain Finkel and Ekanshdeep Gupta</span>
<span class="title">The Well Structured Problem for Presburger Counter Machines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.41">10.4230/LIPIcs.FSTTCS.2019.41</a>
</li>
<li>
<span class="authors">Fabio Gadducci, Hernán Melgratti, Christian Roldán, and Matteo Sammartino</span>
<span class="title">A Categorical Account of Replicated Data Types</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.42">10.4230/LIPIcs.FSTTCS.2019.42</a>
</li>
<li>
<span class="authors">Hans Kleine Büning, Piotr Wojciechowski, and K. Subramani</span>
<span class="title">New Results on Cutting Plane Proofs for Horn Constraint Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.43">10.4230/LIPIcs.FSTTCS.2019.43</a>
</li>
<li>
<span class="authors">Marco Kuhlmann, Andreas Maletti, and Lena Katharina Schiffer</span>
<span class="title">The Tree-Generative Capacity of Combinatory Categorial Grammars</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.44">10.4230/LIPIcs.FSTTCS.2019.44</a>
</li>
<li>
<span class="authors">Denis Kuperberg, Laureline Pinault, and Damien Pous</span>
<span class="title">Cyclic Proofs and Jumping Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.45">10.4230/LIPIcs.FSTTCS.2019.45</a>
</li>
<li>
<span class="authors">Salvatore La Torre and Madhusudan Parthasarathy</span>
<span class="title">Reachability in Concurrent Uninterpreted Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.46">10.4230/LIPIcs.FSTTCS.2019.46</a>
</li>
<li>
<span class="authors">Jérôme Leroux</span>
<span class="title">Distance Between Mutually Reachable Petri Net Configurations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.47">10.4230/LIPIcs.FSTTCS.2019.47</a>
</li>
<li>
<span class="authors">Alexandre Mansard</span>
<span class="title">Boolean Algebras from Trace Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.48">10.4230/LIPIcs.FSTTCS.2019.48</a>
</li>
<li>
<span class="authors">David Mestel</span>
<span class="title">Widths of Regular and Context-Free Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.49">10.4230/LIPIcs.FSTTCS.2019.49</a>
</li>
<li>
<span class="authors">Alexander Rabinovich and Doron Tiferet</span>
<span class="title">Degrees of Ambiguity of Büchi Tree Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.50">10.4230/LIPIcs.FSTTCS.2019.50</a>
</li>
<li>
<span class="authors">Ramanathan S. Thinniyam and Georg Zetzsche</span>
<span class="title">Regular Separability and Intersection Emptiness Are Independent Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2019.51">10.4230/LIPIcs.FSTTCS.2019.51</a>
</li>
</ul>
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing