<h2>LIPIcs, Volume 122, FSTTCS 2018</h2>
<ul>
<li>
<span class="authors">Sumit Ganguly and Paritosh Pandya</span>
<span class="title">LIPIcs, Volume 122, FSTTCS'18, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018">10.4230/LIPIcs.FSTTCS.2018</a>
</li>
<li>
<span class="authors">Sumit Ganguly and Paritosh Pandya</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018.0">10.4230/LIPIcs.FSTTCS.2018.0</a>
</li>
<li>
<span class="authors">Rupak Majumdar</span>
<span class="title">Random Testing for Distributed Systems with Theoretical Guarantees (Invited Paper)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018.1">10.4230/LIPIcs.FSTTCS.2018.1</a>
</li>
<li>
<span class="authors">A. Prasad Sistla</span>
<span class="title">Model Checking Randomized Security Protocols (Invited Paper)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018.2">10.4230/LIPIcs.FSTTCS.2018.2</a>
</li>
<li>
<span class="authors">Ola Svensson</span>
<span class="title">Algorithms for the Asymmetric Traveling Salesman Problem (Invited Paper)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018.3">10.4230/LIPIcs.FSTTCS.2018.3</a>
</li>
<li>
<span class="authors">Santosh Vempala</span>
<span class="title">Continuous Algorithms (Invited Paper)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018.4">10.4230/LIPIcs.FSTTCS.2018.4</a>
</li>
<li>
<span class="authors">Siddharth Bhandari, Prahladh Harsha, Tulasimohan Molli, and Srikanth Srinivasan</span>
<span class="title">On the Probabilistic Degree of OR over the Reals</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018.5">10.4230/LIPIcs.FSTTCS.2018.5</a>
</li>
<li>
<span class="authors">Ramprasad Saptharishi and Anamay Tengse</span>
<span class="title">Quasipolynomial Hitting Sets for Circuits with Restricted Parse Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018.6">10.4230/LIPIcs.FSTTCS.2018.6</a>
</li>
<li>
<span class="authors">V. Arvind, Abhranil Chatterjee, Rajit Datta, and Partha Mukhopadhyay</span>
<span class="title">Univariate Ideal Membership Parameterized by Rank, Degree, and Number of Generators</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018.7">10.4230/LIPIcs.FSTTCS.2018.7</a>
</li>
<li>
<span class="authors">Parosh Aziz Abdulla, Mohamed Faouzi Atig, Shankara Narayanan Krishna, and Shaan Vaidya</span>
<span class="title">Verification of Timed Asynchronous Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018.8">10.4230/LIPIcs.FSTTCS.2018.8</a>
</li>
<li>
<span class="authors">Faried Abu Zaid and Chris Köcher</span>
<span class="title">The Cayley-Graph of the Queue Monoid: Logic and Decidability</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018.9">10.4230/LIPIcs.FSTTCS.2018.9</a>
</li>
<li>
<span class="authors">Faried Abu Zaid</span>
<span class="title">Uniformly Automatic Classes of Finite Structures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018.10">10.4230/LIPIcs.FSTTCS.2018.10</a>
</li>
<li>
<span class="authors">Elazar Goldenberg and Karthik C. S.</span>
<span class="title">Towards a General Direct Product Testing Theorem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018.11">10.4230/LIPIcs.FSTTCS.2018.11</a>
</li>
<li>
<span class="authors">Deepanjan Kesh</span>
<span class="title">Space Complexity of Two Adaptive Bitprobe Schemes Storing Three Elements</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018.12">10.4230/LIPIcs.FSTTCS.2018.12</a>
</li>
<li>
<span class="authors">Siddhesh Chaubal and Anna Gál</span>
<span class="title">New Constructions with Quadratic Separation between Sensitivity and Block Sensitivity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018.13">10.4230/LIPIcs.FSTTCS.2018.13</a>
</li>
<li>
<span class="authors">Kazuyuki Asada and Naoki Kobayashi</span>
<span class="title">Lambda-Definable Order-3 Tree Functions are Well-Quasi-Ordered</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018.14">10.4230/LIPIcs.FSTTCS.2018.14</a>
</li>
<li>
<span class="authors">David Baelde, Anthony Lick, and Sylvain Schmitz</span>
<span class="title">A Hypersequent Calculus with Clusters for Tense Logic over Ordinals</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018.15">10.4230/LIPIcs.FSTTCS.2018.15</a>
</li>
<li>
<span class="authors">Marc Bagnol and Denis Kuperberg</span>
<span class="title">Büchi Good-for-Games Automata Are Efficiently Recognizable</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018.16">10.4230/LIPIcs.FSTTCS.2018.16</a>
</li>
<li>
<span class="authors">Ágnes Cseh and Telikepalli Kavitha</span>
<span class="title">Popular Matchings in Complete Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018.17">10.4230/LIPIcs.FSTTCS.2018.17</a>
</li>
<li>
<span class="authors">Markus Bläser, Balagopal Komarath, and Karteek Sreenivasaiah</span>
<span class="title">Graph Pattern Polynomials</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018.18">10.4230/LIPIcs.FSTTCS.2018.18</a>
</li>
<li>
<span class="authors">Samir Datta, Siddharth Iyer, Raghav Kulkarni, and Anish Mukherjee</span>
<span class="title">Shortest k-Disjoint Paths via Determinants</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018.19">10.4230/LIPIcs.FSTTCS.2018.19</a>
</li>
<li>
<span class="authors">Béatrice Bérard, Stefan Haar, and Loic Hélouët</span>
<span class="title">Hyper Partial Order Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018.20">10.4230/LIPIcs.FSTTCS.2018.20</a>
</li>
<li>
<span class="authors">Udi Boker and Karoliina Lehtinen</span>
<span class="title">On the Way to Alternating Weak Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018.21">10.4230/LIPIcs.FSTTCS.2018.21</a>
</li>
<li>
<span class="authors">Sougata Bose, Anca Muscholl, Vincent Penelle, and Gabriele Puppis</span>
<span class="title">Origin-Equivalence of Two-Way Word Transducers Is in PSPACE</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018.22">10.4230/LIPIcs.FSTTCS.2018.22</a>
</li>
<li>
<span class="authors">Sapna Grover, Neelima Gupta, Samir Khuller, and Aditya Pancholi</span>
<span class="title">Constant Factor Approximation Algorithm for Uniform Hard Capacitated Knapsack Median Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018.23">10.4230/LIPIcs.FSTTCS.2018.23</a>
</li>
<li>
<span class="authors">Manisha Bansal, Naveen Garg, and Neelima Gupta</span>
<span class="title">A 5-Approximation for Universal Facility Location</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018.24">10.4230/LIPIcs.FSTTCS.2018.24</a>
</li>
<li>
<span class="authors">Bhaskar Ray Chaudhury, Yun Kuen Cheung, Jugal Garg, Naveen Garg, Martin Hoefer, and Kurt Mehlhorn</span>
<span class="title">On Fair Division for Indivisible Items</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018.25">10.4230/LIPIcs.FSTTCS.2018.25</a>
</li>
<li>
<span class="authors">Bhaskar Ray Chaudhury and Kurt Mehlhorn</span>
<span class="title">Combinatorial Algorithms for General Linear Arrow-Debreu Markets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018.26">10.4230/LIPIcs.FSTTCS.2018.26</a>
</li>
<li>
<span class="authors">Umang Bhaskar and Abheek Ghosh</span>
<span class="title">On the Welfare of Cardinal Voting Mechanisms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018.27">10.4230/LIPIcs.FSTTCS.2018.27</a>
</li>
<li>
<span class="authors">Damien Busatto-Gaston, Benjamin Monmege, and Pierre-Alain Reynier</span>
<span class="title">Symbolic Approximation of Weighted Timed Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018.28">10.4230/LIPIcs.FSTTCS.2018.28</a>
</li>
<li>
<span class="authors">Alexandre Debant, Stéphanie Delaune, and Cyrille Wiedling</span>
<span class="title">A Symbolic Framework to Analyse Physical Proximity in Security Protocols</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018.29">10.4230/LIPIcs.FSTTCS.2018.29</a>
</li>
<li>
<span class="authors">Emmanuel Filiot, Olivier Gauwin, Nathan Lhote, and Anca Muscholl</span>
<span class="title">On Canonical Models for Rational Functions over Infinite Words</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018.30">10.4230/LIPIcs.FSTTCS.2018.30</a>
</li>
<li>
<span class="authors">Alain Finkel, Jérôme Leroux, and Grégoire Sutre</span>
<span class="title">Reachability for Two-Counter Machines with One Test and One Reset</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018.31">10.4230/LIPIcs.FSTTCS.2018.31</a>
</li>
<li>
<span class="authors">Pierre Ganty and Elena Gutiérrez</span>
<span class="title">The Parikh Property for Weighted Context-Free Grammars</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018.32">10.4230/LIPIcs.FSTTCS.2018.32</a>
</li>
<li>
<span class="authors">Amy Babay, Michael Dinitz, and Zeyu Zhang</span>
<span class="title">Characterizing Demand Graphs for (Fixed-Parameter) Shallow-Light Steiner Network</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018.33">10.4230/LIPIcs.FSTTCS.2018.33</a>
</li>
<li>
<span class="authors">Mohsen Alambardar Meybodi, Fedor Fomin, Amer E. Mouawad, and Fahad Panolan</span>
<span class="title">On the Parameterized Complexity of [1,j]-Domination Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018.34">10.4230/LIPIcs.FSTTCS.2018.34</a>
</li>
<li>
<span class="authors">Pranabendu Misra, Saket Saurabh, Roohani Sharma, and Meirav Zehavi</span>
<span class="title">Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018.35">10.4230/LIPIcs.FSTTCS.2018.35</a>
</li>
<li>
<span class="authors">Gilles Geeraerts, Shibashis Guha, and Jean-François Raskin</span>
<span class="title">Safe and Optimal Scheduling for Hard and Soft Tasks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018.36">10.4230/LIPIcs.FSTTCS.2018.36</a>
</li>
<li>
<span class="authors">Furio Honsell, Luigi Liquori, Claude Stolze, and Ivan Scagnetto</span>
<span class="title">The Delta-Framework</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018.37">10.4230/LIPIcs.FSTTCS.2018.37</a>
</li>
<li>
<span class="authors">Stéphane Le Roux, Arno Pauly, and Mickael Randour</span>
<span class="title">Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018.38">10.4230/LIPIcs.FSTTCS.2018.38</a>
</li>
<li>
<span class="authors">Sumedh Tirodkar</span>
<span class="title">Deterministic Algorithms for Maximum Matching on General Graphs in the Semi-Streaming Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018.39">10.4230/LIPIcs.FSTTCS.2018.39</a>
</li>
<li>
<span class="authors">Karl Bringmann and Bhaskar Ray Chaudhury</span>
<span class="title">Sketching, Streaming, and Fine-Grained Complexity of (Weighted) LCS</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018.40">10.4230/LIPIcs.FSTTCS.2018.40</a>
</li>
<li>
<span class="authors">Balthazar Bauer, Jevgenijs Vihrovs, and Hoeteck Wee</span>
<span class="title">On the Inner Product Predicate and a Generalization of Matching Vector Families</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018.41">10.4230/LIPIcs.FSTTCS.2018.41</a>
</li>
<li>
<span class="authors">Alessio Mansutti</span>
<span class="title">Extending Propositional Separation Logic for Robustness Properties</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018.42">10.4230/LIPIcs.FSTTCS.2018.42</a>
</li>
<li>
<span class="authors">Anantha Padmanabha, R Ramanujam, and Yanjing Wang</span>
<span class="title">Bundled Fragments of First-Order Modal Logic: (Un)Decidability</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018.43">10.4230/LIPIcs.FSTTCS.2018.43</a>
</li>
<li>
<span class="authors">Vincent Penelle, Sylvain Salvati, and Grégoire Sutre</span>
<span class="title">On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018.44">10.4230/LIPIcs.FSTTCS.2018.44</a>
</li>
<li>
<span class="authors">Swaroop N. Prabhakar and Vikram Sharma</span>
<span class="title">Stronger Tradeoffs for Orthogonal Range Querying in the Semigroup Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018.45">10.4230/LIPIcs.FSTTCS.2018.45</a>
</li>
<li>
<span class="authors">Junjie Luo, Hendrik Molter, André Nichterlein, and Rolf Niedermeier</span>
<span class="title">Parameterized Dynamic Cluster Editing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018.46">10.4230/LIPIcs.FSTTCS.2018.46</a>
</li>
<li>
<span class="authors">Thomas Place and Marc Zeitoun</span>
<span class="title">The Complexity of Separation for Levels in Concatenation Hierarchies</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018.47">10.4230/LIPIcs.FSTTCS.2018.47</a>
</li>
<li>
<span class="authors">Adrien Boiret, Radoslaw Piórkowski, and Janusz Schmude</span>
<span class="title">Reducing Transducer Equivalence to Register Automata Problems Solved by "Hilbert Method"</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2018.48">10.4230/LIPIcs.FSTTCS.2018.48</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