<h2>LIPIcs, Volume 29, FSTTCS 2014</h2>
<ul>
<li>
<span class="authors">Venkatesh Raman and S. P. Suresh</span>
<span class="title">LIPIcs, Volume 29, FSTTCS'14, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014">10.4230/LIPIcs.FSTTCS.2014</a>
</li>
<li>
<span class="authors">Venkatesh Raman and S. P. Suresh</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.i">10.4230/LIPIcs.FSTTCS.2014.i</a>
</li>
<li>
<span class="authors">Nikhil Bansal</span>
<span class="title">New Developments in Iterated Rounding (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.1">10.4230/LIPIcs.FSTTCS.2014.1</a>
</li>
<li>
<span class="authors">Aiswarya Cyriac and Paul Gastin</span>
<span class="title">Reasoning About Distributed Systems: WYSIWYG (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.11">10.4230/LIPIcs.FSTTCS.2014.11</a>
</li>
<li>
<span class="authors">Martin Grohe</span>
<span class="title">Colour Refinement: A Simple Partitioning Algorithm with Applications From Graph Isomorphism Testing to Machine Learning (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.31">10.4230/LIPIcs.FSTTCS.2014.31</a>
</li>
<li>
<span class="authors">Orna Kupferman and Tami Tamir</span>
<span class="title">Properties and Utilization of Capacitated Automata (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.33">10.4230/LIPIcs.FSTTCS.2014.33</a>
</li>
<li>
<span class="authors">Erick Chastain, Adi Livnat, Christos H. Papadimitriou, and Umesh V. Vazirani</span>
<span class="title">Algorithms, Games, and Evolution (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.45">10.4230/LIPIcs.FSTTCS.2014.45</a>
</li>
<li>
<span class="authors">Richard Ryan Williams</span>
<span class="title">The Polynomial Method in Circuit Complexity Applied to Algorithm Design (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.47">10.4230/LIPIcs.FSTTCS.2014.47</a>
</li>
<li>
<span class="authors">Geevarghese Philip and M. S. Ramanujan</span>
<span class="title">Vertex Exponential Algorithms for Connected f-Factors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.61">10.4230/LIPIcs.FSTTCS.2014.61</a>
</li>
<li>
<span class="authors">Manu Basavaraju, Fedor V. Fomin, Petr A. Golovach, and Saket Saurabh</span>
<span class="title">Connecting Vertices by Independent Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.73">10.4230/LIPIcs.FSTTCS.2014.73</a>
</li>
<li>
<span class="authors">Archontia C. Giannopoulou, Daniel Lokshtanov, Saket Saurabh, and Ondrej Suchy</span>
<span class="title">Tree Deletion Set Has a Polynomial Kernel (but no OPT^O(1) Approximation)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.85">10.4230/LIPIcs.FSTTCS.2014.85</a>
</li>
<li>
<span class="authors">Konrad K. Dabrowski, Petr A. Golovach, Pim van 't Hof, and Daniel Paulusma</span>
<span class="title">Editing to Eulerian Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.97">10.4230/LIPIcs.FSTTCS.2014.97</a>
</li>
<li>
<span class="authors">Christoph Berkholz and Michael Elberfeld</span>
<span class="title">Parameterized Complexity of Fixed Variable Logics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.109">10.4230/LIPIcs.FSTTCS.2014.109</a>
</li>
<li>
<span class="authors">Laurent Doyen, Line Juhl, Kim G. Larsen, Nicolas Markey, and Mahsa Shirmohammadi</span>
<span class="title">Synchronizing Words for Weighted and Timed Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.121">10.4230/LIPIcs.FSTTCS.2014.121</a>
</li>
<li>
<span class="authors">Emmanuel Filiot, Raffaella Gentilini, and Jean-Francois Raskin</span>
<span class="title">Finite-Valued Weighted Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.133">10.4230/LIPIcs.FSTTCS.2014.133</a>
</li>
<li>
<span class="authors">Emmanuel Filiot, Shankara Narayanan Krishna, and Ashutosh Trivedi</span>
<span class="title">First-order Definable String Transformations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.147">10.4230/LIPIcs.FSTTCS.2014.147</a>
</li>
<li>
<span class="authors">Shaull Almagor, Denis Kuperberg, and Orna Kupferman</span>
<span class="title">Regular Sensing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.161">10.4230/LIPIcs.FSTTCS.2014.161</a>
</li>
<li>
<span class="authors">Matthias Keil and Peter Thiemann</span>
<span class="title">Symbolic Solving of Extended Regular Expression Inequalities</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.175">10.4230/LIPIcs.FSTTCS.2014.175</a>
</li>
<li>
<span class="authors">Adrian Bock, Yuri Faenza, Carsten Moldenhauer, and Andres Jacinto Ruiz-Vargas</span>
<span class="title">Solving the Stable Set Problem in Terms of the Odd Cycle Packing Number</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.187">10.4230/LIPIcs.FSTTCS.2014.187</a>
</li>
<li>
<span class="authors">Konstantinos Georgiou and Edward Lee</span>
<span class="title">Lift & Project Systems Performing on the Partial Vertex Cover Polytope</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.199">10.4230/LIPIcs.FSTTCS.2014.199</a>
</li>
<li>
<span class="authors">Sonika Arora, Venkatesan T. Chakaravarthy, Kanika Gupta, Neelima Gupta, and Yogish Sabharwal</span>
<span class="title">Replica Placement on Directed Acyclic Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.213">10.4230/LIPIcs.FSTTCS.2014.213</a>
</li>
<li>
<span class="authors">Manoj Gupta</span>
<span class="title">Maintaining Approximate Maximum Matching in an Incremental Bipartite Graph in Polylogarithmic Update Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.227">10.4230/LIPIcs.FSTTCS.2014.227</a>
</li>
<li>
<span class="authors">Hazem Torfah and Martin Zimmermann</span>
<span class="title">The Complexity of Counting Models of Linear-time Temporal Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.241">10.4230/LIPIcs.FSTTCS.2014.241</a>
</li>
<li>
<span class="authors">Fu Song and Zhilin Wu</span>
<span class="title">Extending Temporal Logics with Data Variable Quantifications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.253">10.4230/LIPIcs.FSTTCS.2014.253</a>
</li>
<li>
<span class="authors">Thomas Colcombet and Amaldev Manuel</span>
<span class="title">Generalized Data Automata and Fixpoint Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.267">10.4230/LIPIcs.FSTTCS.2014.267</a>
</li>
<li>
<span class="authors">Claire David, Nadime Francis, and Filip Murlak</span>
<span class="title">Consistency of Injective Tree Patterns</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.279">10.4230/LIPIcs.FSTTCS.2014.279</a>
</li>
<li>
<span class="authors">Gonzalo Navarro, Rajeev Raman, and Srinivasa Rao Satti</span>
<span class="title">Asymptotically Optimal Encodings for Range Selection</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.291">10.4230/LIPIcs.FSTTCS.2014.291</a>
</li>
<li>
<span class="authors">Roberto Grossi, Giulia Menconi, Nadia Pisanti, Roberto Trani, and Soren Vind</span>
<span class="title">Output-Sensitive Pattern Extraction in Sequences</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.303">10.4230/LIPIcs.FSTTCS.2014.303</a>
</li>
<li>
<span class="authors">Sariel Har-Peled and Nirman Kumar</span>
<span class="title">Robust Proximity Search for Balls Using Sublinear Space</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.315">10.4230/LIPIcs.FSTTCS.2014.315</a>
</li>
<li>
<span class="authors">Efraim Gelman and Amnon Ta-Shma</span>
<span class="title">The Benes Network is q*(q-1)/2n-Almost q-set-wise Independent</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.327">10.4230/LIPIcs.FSTTCS.2014.327</a>
</li>
<li>
<span class="authors">Dmitry Chistikov</span>
<span class="title">Notes on Counting with Finite Machines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.339">10.4230/LIPIcs.FSTTCS.2014.339</a>
</li>
<li>
<span class="authors">Patricia Bouyer, Nicolas Markey, and Daniel Stan</span>
<span class="title">Mixed Nash Equilibria in Concurrent Terminal-Reward Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.351">10.4230/LIPIcs.FSTTCS.2014.351</a>
</li>
<li>
<span class="authors">Paul Hunter and Jean-Francois Raskin</span>
<span class="title">Quantitative Games with Interval Objectives</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.365">10.4230/LIPIcs.FSTTCS.2014.365</a>
</li>
<li>
<span class="authors">Thomas Colcombet, Nathanael Fijalkow, and Florian Horn</span>
<span class="title">Playing Safe</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.379">10.4230/LIPIcs.FSTTCS.2014.379</a>
</li>
<li>
<span class="authors">Flávio L. C. de Moura, Delia Kesner, and Mauricio Ayala-Rincón</span>
<span class="title">Metaconfluence of Calculi with Explicit Substitutions at a Distance</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.391">10.4230/LIPIcs.FSTTCS.2014.391</a>
</li>
<li>
<span class="authors">Paolo Baldan, Filippo Bonchi, Henning Kerstan, and Barbara König</span>
<span class="title">Behavioral Metrics via Functor Lifting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.403">10.4230/LIPIcs.FSTTCS.2014.403</a>
</li>
<li>
<span class="authors">Nathalie Bertrand, Serge Haddad, and Engel Lefaucheux</span>
<span class="title">Foundation of Diagnosis and Predictability in Probabilistic Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.417">10.4230/LIPIcs.FSTTCS.2014.417</a>
</li>
<li>
<span class="authors">Thomas A. Henzinger, Jan Otop, and Roopsha Samanta</span>
<span class="title">Lipschitz Robustness of Finite-state Transducers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.431">10.4230/LIPIcs.FSTTCS.2014.431</a>
</li>
<li>
<span class="authors">Debasis Mandal, A. Pavan, and Rajeswari Venugopalan</span>
<span class="title">Separating Cook Completeness from Karp-Levin Completeness Under a Worst-Case Hardness Hypothesis</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.445">10.4230/LIPIcs.FSTTCS.2014.445</a>
</li>
<li>
<span class="authors">Danny Hucke, Markus Lohrey, and Eric Noeth</span>
<span class="title">Constructing Small Tree Grammars and Small Circuits for Formulas</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.457">10.4230/LIPIcs.FSTTCS.2014.457</a>
</li>
<li>
<span class="authors">Ryan O'Donnell and A. C. Cem Say</span>
<span class="title">One Time-traveling Bit is as Good as Logarithmically Many</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.469">10.4230/LIPIcs.FSTTCS.2014.469</a>
</li>
<li>
<span class="authors">Hartmut Klauck and Supartha Podder</span>
<span class="title">New Bounds for the Garden-Hose Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.481">10.4230/LIPIcs.FSTTCS.2014.481</a>
</li>
<li>
<span class="authors">Arnaud Durand, Meena Mahajan, Guillaume Malod, Nicolas de Rugy-Altherre, and Nitin Saurabh</span>
<span class="title">Homomorphism Polynomials Complete for VP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.493">10.4230/LIPIcs.FSTTCS.2014.493</a>
</li>
<li>
<span class="authors">Rohit Chadha, Umang Mathur, and Stefan Schwoon</span>
<span class="title">Computing Information Flow Using Symbolic Model-Checking</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.505">10.4230/LIPIcs.FSTTCS.2014.505</a>
</li>
<li>
<span class="authors">Fabrizio Biondi, Axel Legay, Bo Friis Nielsen, Pasquale Malacaria, and Andrzej Wasowski</span>
<span class="title">Information Leakage of Non-Terminating Processes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.517">10.4230/LIPIcs.FSTTCS.2014.517</a>
</li>
<li>
<span class="authors">Jean-Francois Raskin and Ocan Sankur</span>
<span class="title">Multiple-Environment Markov Decision Processes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.531">10.4230/LIPIcs.FSTTCS.2014.531</a>
</li>
<li>
<span class="authors">Franck Cassez, Christian Müller, and Karla Burnett</span>
<span class="title">Summary-Based Inter-Procedural Analysis via Modular Trace Refinement</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.545">10.4230/LIPIcs.FSTTCS.2014.545</a>
</li>
<li>
<span class="authors">Mary Southern and Kaustuv Chaudhuri</span>
<span class="title">A Two-Level Logic Approach to Reasoning About Typed Specification Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.557">10.4230/LIPIcs.FSTTCS.2014.557</a>
</li>
<li>
<span class="authors">Taolue Chen and Tingting Han</span>
<span class="title">On the Complexity of Computing Maximum Entropy for Markovian Models</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.571">10.4230/LIPIcs.FSTTCS.2014.571</a>
</li>
<li>
<span class="authors">Diptarka Chakraborty, A. Pavan, Raghunath Tewari, N. V. Vinodchandran, and Lin Forrest Yang</span>
<span class="title">New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.585">10.4230/LIPIcs.FSTTCS.2014.585</a>
</li>
<li>
<span class="authors">Anant Dhayal, Jayalal Sarma, and Saurabh Sawlani</span>
<span class="title">Polynomial Min/Max-weighted Reachability is in Unambiguous Log-space</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.597">10.4230/LIPIcs.FSTTCS.2014.597</a>
</li>
<li>
<span class="authors">Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, and Prakash Saivasan</span>
<span class="title">On Bounded Reachability Analysis of Shared Memory Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.611">10.4230/LIPIcs.FSTTCS.2014.611</a>
</li>
<li>
<span class="authors">Benedikt Bollig, Paul Gastin, and Akshay Kumar</span>
<span class="title">Parameterized Communicating Automata: Complementation and Model Checking</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.625">10.4230/LIPIcs.FSTTCS.2014.625</a>
</li>
<li>
<span class="authors">Anca Muscholl and Igor Walukiewicz</span>
<span class="title">Distributed Synthesis for Acyclic Architectures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.639">10.4230/LIPIcs.FSTTCS.2014.639</a>
</li>
<li>
<span class="authors">Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmet Kara, and Othmane Rezine</span>
<span class="title">Verification of Dynamic Register Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2014.653">10.4230/LIPIcs.FSTTCS.2014.653</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