<h2>LIPIcs, Volume 65, FSTTCS 2016</h2>
<ul>
<li>
<span class="authors">Akash Lal, S. Akshay, Saket Saurabh, and Sandeep Sen</span>
<span class="title">LIPICs, Volume 65, FSTTCS'16, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016">10.4230/LIPIcs.FSTTCS.2016</a>
</li>
<li>
<span class="authors">Akash Lal, S. Akshay, Saket Saurabh, and Sandeep Sen</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization, External Reviewers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.0">10.4230/LIPIcs.FSTTCS.2016.0</a>
</li>
<li>
<span class="authors">Mikkel Thorup</span>
<span class="title">Fast and Powerful Hashing Using Tabulation (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.1">10.4230/LIPIcs.FSTTCS.2016.1</a>
</li>
<li>
<span class="authors">Mooly Sagiv</span>
<span class="title">Simple Invariants for Proving the Safety of Distributed Protocols (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.2">10.4230/LIPIcs.FSTTCS.2016.2</a>
</li>
<li>
<span class="authors">Holger Hermanns</span>
<span class="title">My O Is Bigger Than Yours (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.3">10.4230/LIPIcs.FSTTCS.2016.3</a>
</li>
<li>
<span class="authors">Aleksander Madry</span>
<span class="title">Continuous Optimization: The “Right” Language for Graph Algorithms? (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.4">10.4230/LIPIcs.FSTTCS.2016.4</a>
</li>
<li>
<span class="authors">Fedor V. Fomin</span>
<span class="title">Graph Decompositions and Algorithms (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.5">10.4230/LIPIcs.FSTTCS.2016.5</a>
</li>
<li>
<span class="authors">Tevfik Bultan</span>
<span class="title">Side Channel Analysis Using a Model Counting Constraint Solver and Symbolic Execution (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.6">10.4230/LIPIcs.FSTTCS.2016.6</a>
</li>
<li>
<span class="authors">Sanjoy Baruah, Arvind Easwaran, and Zhishan Guo</span>
<span class="title">Mixed-Criticality Scheduling to Minimize Makespan</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.7">10.4230/LIPIcs.FSTTCS.2016.7</a>
</li>
<li>
<span class="authors">Aounon Kumar</span>
<span class="title">Capacitated k-Center Problem with Vertex Weights</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.8">10.4230/LIPIcs.FSTTCS.2016.8</a>
</li>
<li>
<span class="authors">Waldo Gálvez, Fabrizio Grandoni, Salvatore Ingala, and Arindam Khan</span>
<span class="title">Improved Pseudo-Polynomial-Time Approximation for Strip Packing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.9">10.4230/LIPIcs.FSTTCS.2016.9</a>
</li>
<li>
<span class="authors">Amit Deshpande, Prahladh Harsha, and Rakesh Venkat</span>
<span class="title">Embedding Approximately Low-Dimensional l_2^2 Metrics into l_1</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.10">10.4230/LIPIcs.FSTTCS.2016.10</a>
</li>
<li>
<span class="authors">Anindya Banerjee, David A. Naumann, and Mohammad Nikouei</span>
<span class="title">Relational Logic with Framing and Hypotheses</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.11">10.4230/LIPIcs.FSTTCS.2016.11</a>
</li>
<li>
<span class="authors">Vrunda Dave, Shankara Narayanan Krishna, and Ashutosh Trivedi</span>
<span class="title">FO-Definable Transformations of Infinite Strings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.12">10.4230/LIPIcs.FSTTCS.2016.12</a>
</li>
<li>
<span class="authors">Emmanuel Filiot, Olivier Gauwin, and Nathan Lhote</span>
<span class="title">Aperiodicity of Rational Functions Is PSPACE-Complete</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.13">10.4230/LIPIcs.FSTTCS.2016.13</a>
</li>
<li>
<span class="authors">Bartek Klin, Slawomir Lasota, Joanna Ochremiak, and Szymon Torunczyk</span>
<span class="title">Homomorphism Problems for First-Order Definable Structures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.14">10.4230/LIPIcs.FSTTCS.2016.14</a>
</li>
<li>
<span class="authors">Karthik C. S. and Sébastien Tavenas</span>
<span class="title">On the Sensitivity Conjecture for Disjunctive Normal Forms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.15">10.4230/LIPIcs.FSTTCS.2016.15</a>
</li>
<li>
<span class="authors">Jaikumar Radhakrishnan and Swagato Sanyal</span>
<span class="title">The Zero-Error Randomized Query Complexity of the Pointer Function</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.16">10.4230/LIPIcs.FSTTCS.2016.16</a>
</li>
<li>
<span class="authors">Prahladh Harsha and Srikanth Srinivasan</span>
<span class="title">Robust Multiplication-Based Tests for Reed-Muller Codes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.17">10.4230/LIPIcs.FSTTCS.2016.17</a>
</li>
<li>
<span class="authors">Moses Ganardi, Danny Hucke, and Markus Lohrey</span>
<span class="title">Querying Regular Languages over Sliding Windows</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.18">10.4230/LIPIcs.FSTTCS.2016.18</a>
</li>
<li>
<span class="authors">Xuan Bach Le, Aquinas Hobor, and Anthony W. Lin</span>
<span class="title">Decidability and Complexity of Tree Share Formulas</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.19">10.4230/LIPIcs.FSTTCS.2016.19</a>
</li>
<li>
<span class="authors">Benedikt Bollig</span>
<span class="title">One-Counter Automata with Counter Observability</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.20">10.4230/LIPIcs.FSTTCS.2016.20</a>
</li>
<li>
<span class="authors">Ashutosh Rai and M. S. Ramanujan</span>
<span class="title">Strong Parameterized Deletion: Bipartite Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.21">10.4230/LIPIcs.FSTTCS.2016.21</a>
</li>
<li>
<span class="authors">Fahad Panolan and Meirav Zehavi</span>
<span class="title">Parameterized Algorithms for List K-Cycle</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.22">10.4230/LIPIcs.FSTTCS.2016.22</a>
</li>
<li>
<span class="authors">R. Krithika, Pranabendu Misra, Ashutosh Rai, and Prafullkumar Tale</span>
<span class="title">Lossy Kernels for Graph Contraction Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.23">10.4230/LIPIcs.FSTTCS.2016.23</a>
</li>
<li>
<span class="authors">Mithilesh Kumar and Daniel Lokshtanov</span>
<span class="title">Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Bipartite Tournaments</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.24">10.4230/LIPIcs.FSTTCS.2016.24</a>
</li>
<li>
<span class="authors">Kim G. Larsen, Radu Mardare, and Bingtian Xue</span>
<span class="title">Probabilistic Mu-Calculus: Decidability and Complete Axiomatization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.25">10.4230/LIPIcs.FSTTCS.2016.25</a>
</li>
<li>
<span class="authors">Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, and Pietro Sala</span>
<span class="title">Interval vs. Point Temporal Logic Model Checking: an Expressiveness Comparison</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.26">10.4230/LIPIcs.FSTTCS.2016.26</a>
</li>
<li>
<span class="authors">Javier Esparza, Pierre Ganty, Jérôme Leroux, and Rupak Majumdar</span>
<span class="title">Model Checking Population Protocols</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.27">10.4230/LIPIcs.FSTTCS.2016.27</a>
</li>
<li>
<span class="authors">Alexander Weinert and Martin Zimmermann</span>
<span class="title">Visibly Linear Dynamic Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.28">10.4230/LIPIcs.FSTTCS.2016.28</a>
</li>
<li>
<span class="authors">Sushmita Gupta and Sanjukta Roy</span>
<span class="title">Stable Matching Games: Manipulation via Subgraph Isomorphism</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.29">10.4230/LIPIcs.FSTTCS.2016.29</a>
</li>
<li>
<span class="authors">Umang Bhaskar, Ajil Jalal, and Rahul Vaze</span>
<span class="title">The Adwords Problem with Strict Capacity Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.30">10.4230/LIPIcs.FSTTCS.2016.30</a>
</li>
<li>
<span class="authors">Nirman Kumar, Benjamin Raichel, Subhash Suri, and Kevin Verbeek</span>
<span class="title">Most Likely Voronoi Diagrams in Higher Dimensions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.31">10.4230/LIPIcs.FSTTCS.2016.31</a>
</li>
<li>
<span class="authors">Aritra Banik, Fahad Panolan, Venkatesh Raman, and Vibha Sahlot</span>
<span class="title">Fréchet Distance Between a Line and Avatar Point Set</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.32">10.4230/LIPIcs.FSTTCS.2016.32</a>
</li>
<li>
<span class="authors">Ankit Chauhan, Tobias Friedrich, and Ralf Rothenberger</span>
<span class="title">Greed is Good for Deterministic Scale-Free Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.33">10.4230/LIPIcs.FSTTCS.2016.33</a>
</li>
<li>
<span class="authors">Mark de Berg, Bart M. P. Jansen, and Debankur Mukherjee</span>
<span class="title">Independent-Set Reconfiguration Thresholds of Hereditary Graph Classes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.34">10.4230/LIPIcs.FSTTCS.2016.34</a>
</li>
<li>
<span class="authors">Pawel Gawrychowski and Artur Jez</span>
<span class="title">LZ77 Factorisation of Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.35">10.4230/LIPIcs.FSTTCS.2016.35</a>
</li>
<li>
<span class="authors">Philip Bille, Anders Roy Christiansen, Patrick Hagge Cording, and Inge Li Gortz</span>
<span class="title">Finger Search in Grammar-Compressed Strings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.36">10.4230/LIPIcs.FSTTCS.2016.36</a>
</li>
<li>
<span class="authors">Krishnamoorthy Dinesh, Sajin Koroth, and Jayalal Sarma</span>
<span class="title">Characterization and Lower Bounds for Branching Program Size Using Projective Dimension</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.37">10.4230/LIPIcs.FSTTCS.2016.37</a>
</li>
<li>
<span class="authors">Mrinal Kumar and Ramprasad Saptharishi</span>
<span class="title">Finer Separations Between Shallow Arithmetic Circuits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.38">10.4230/LIPIcs.FSTTCS.2016.38</a>
</li>
<li>
<span class="authors">Ramya C. and B. V. Raghavendra Rao</span>
<span class="title">Sum of Products of Read-Once Formulas</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.39">10.4230/LIPIcs.FSTTCS.2016.39</a>
</li>
<li>
<span class="authors">Olaf Beyersdorff, Leroy Chew, Meena Mahajan, and Anil Shukla</span>
<span class="title">Understanding Cutting Planes for QBFs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.40">10.4230/LIPIcs.FSTTCS.2016.40</a>
</li>
<li>
<span class="authors">Lukás Holík, Roland Meyer, and Sebastian Muskalla</span>
<span class="title">Summaries for Context-Free Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.41">10.4230/LIPIcs.FSTTCS.2016.41</a>
</li>
<li>
<span class="authors">Romain Brenguier, Guillermo A. Pérez, Jean-Francois Raskin, and Ocan Sankur</span>
<span class="title">Admissibility in Quantitative Graph Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.42">10.4230/LIPIcs.FSTTCS.2016.42</a>
</li>
<li>
<span class="authors">Felix Klein and Martin Zimmermann</span>
<span class="title">Prompt Delay</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.43">10.4230/LIPIcs.FSTTCS.2016.43</a>
</li>
<li>
<span class="authors">Shibashis Guha, Marcin Jurdzinski, Shankara Narayanan Krishna, and Ashutosh Trivedi</span>
<span class="title">Mean-Payoff Games on Timed Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.44">10.4230/LIPIcs.FSTTCS.2016.44</a>
</li>
<li>
<span class="authors">Piotr Berman, Meiram Murzabulatov, and Sofya Raskhodnikova</span>
<span class="title">The Power and Limitations of Uniform Samples in Testing Properties of Figures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.45">10.4230/LIPIcs.FSTTCS.2016.45</a>
</li>
<li>
<span class="authors">Karthekeyan Chandrasekaran, Mahdi Cheraghchi, Venkata Gandikota, and Elena Grigorescu</span>
<span class="title">Local Testing for Membership in Lattices</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.46">10.4230/LIPIcs.FSTTCS.2016.46</a>
</li>
<li>
<span class="authors">Sriram V. Pemmaraju and Vivek B. Sardeshmukh</span>
<span class="title">Super-Fast MST Algorithms in the Congested Clique Using o(m) Messages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.47">10.4230/LIPIcs.FSTTCS.2016.47</a>
</li>
<li>
<span class="authors">Frédéric Herbreteau, B. Srivathsan, Thanh-Tung Tran, and Igor Walukiewicz</span>
<span class="title">Why Liveness for Timed Automata Is Hard, and What We Can Do About It</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.48">10.4230/LIPIcs.FSTTCS.2016.48</a>
</li>
<li>
<span class="authors">Maximilian P. L. Haslbeck and Tobias Nipkow</span>
<span class="title">Verified Analysis of List Update Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.49">10.4230/LIPIcs.FSTTCS.2016.49</a>
</li>
<li>
<span class="authors">Jaroslav Bendík, Nikola Benes, Ivana Cerná, and Jirí Barnat</span>
<span class="title">Tunable Online MUS/MSS Enumeration</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2016.50">10.4230/LIPIcs.FSTTCS.2016.50</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