<h2>LIPIcs, Volume 45, FSTTCS 2015</h2>
<ul>
<li>
<span class="authors">Prahladh Harsha and G. Ramalingam</span>
<span class="title">LIPIcs, Volume 45, FSTTCS'15, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015">10.4230/LIPIcs.FSTTCS.2015</a>
</li>
<li>
<span class="authors">Prahladh Harsha and G. Ramalingam</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015.i">10.4230/LIPIcs.FSTTCS.2015.i</a>
</li>
<li>
<span class="authors">Moses S. Charikar</span>
<span class="title">Bypassing Worst Case Analysis: Tensor Decomposition and Clustering (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015.1">10.4230/LIPIcs.FSTTCS.2015.1</a>
</li>
<li>
<span class="authors">Ahmed Bouajjani, Michael Emmi, Constantin Enea, and Jad Hamza</span>
<span class="title">Checking Correctness of Concurrent Objects: Tractable Reductions to Reachability (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015.2">10.4230/LIPIcs.FSTTCS.2015.2</a>
</li>
<li>
<span class="authors">James Worrell</span>
<span class="title">Reachability Problems for Continuous Linear Dynamical Systems (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015.5">10.4230/LIPIcs.FSTTCS.2015.5</a>
</li>
<li>
<span class="authors">Boaz Barak</span>
<span class="title">Convexity, Bayesianism, and the Quest Towards Optimal Algorithms (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015.7">10.4230/LIPIcs.FSTTCS.2015.7</a>
</li>
<li>
<span class="authors">Ankur Moitra</span>
<span class="title">Beyond Matrix Completion (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015.8">10.4230/LIPIcs.FSTTCS.2015.8</a>
</li>
<li>
<span class="authors">Suresh Jagannathan</span>
<span class="title">Relational Refinement Types for Higher-Order Shape Transformers (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015.9">10.4230/LIPIcs.FSTTCS.2015.9</a>
</li>
<li>
<span class="authors">Keshav Goyal and Tobias Mömke</span>
<span class="title">Robust Reoptimization of Steiner Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015.10">10.4230/LIPIcs.FSTTCS.2015.10</a>
</li>
<li>
<span class="authors">Anamitra Roy Choudhury, Syamantak Das, and Amit Kumar</span>
<span class="title">Minimizing Weighted lp-Norm of Flow-Time in the Rejection Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015.25">10.4230/LIPIcs.FSTTCS.2015.25</a>
</li>
<li>
<span class="authors">Hal Daumé III, Samir Khuller, Manish Purohit, and Gregory Sanders</span>
<span class="title">On Correcting Inputs: Inverse Optimization for Online Structured Prediction</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015.38">10.4230/LIPIcs.FSTTCS.2015.38</a>
</li>
<li>
<span class="authors">Sepehr Assadi, Sanjeev Khanna, Yang Li, and Val Tannen</span>
<span class="title">Dynamic Sketching for Graph Optimization Problems with Applications to Cut-Preserving Sketches</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015.52">10.4230/LIPIcs.FSTTCS.2015.52</a>
</li>
<li>
<span class="authors">Patricia Bouyer, Patrick Gardy, and Nicolas Markey</span>
<span class="title">Weighted Strategy Logic with Boolean Goals Over One-Counter Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015.69">10.4230/LIPIcs.FSTTCS.2015.69</a>
</li>
<li>
<span class="authors">Prateek Karandikar and Philippe Schnoebelen</span>
<span class="title">Decidability in the Logic of Subsequences and Supersequences</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015.84">10.4230/LIPIcs.FSTTCS.2015.84</a>
</li>
<li>
<span class="authors">Thomas Colcombet and Amaldev Manuel</span>
<span class="title">Fragments of Fixpoint Logic on Data Words</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015.98">10.4230/LIPIcs.FSTTCS.2015.98</a>
</li>
<li>
<span class="authors">Lukas Fleischer and Manfred Kufleitner</span>
<span class="title">Efficient Algorithms for Morphisms over Omega-Regular Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015.112">10.4230/LIPIcs.FSTTCS.2015.112</a>
</li>
<li>
<span class="authors">Ashish Chiplunkar and Sundar Vishwanathan</span>
<span class="title">Approximating the Regular Graphic TSP in Near Linear Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015.125">10.4230/LIPIcs.FSTTCS.2015.125</a>
</li>
<li>
<span class="authors">Arindam Khan and Mohit Singh</span>
<span class="title">On Weighted Bipartite Edge Coloring</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015.136">10.4230/LIPIcs.FSTTCS.2015.136</a>
</li>
<li>
<span class="authors">Karthekeyan Chandrasekaran, Venkata Gandikota, and Elena Grigorescu</span>
<span class="title">Deciding Orthogonality in Construction-A Lattices</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015.151">10.4230/LIPIcs.FSTTCS.2015.151</a>
</li>
<li>
<span class="authors">Lorenzo Clemente, Pawel Parys, Sylvain Salvati, and Igor Walukiewicz</span>
<span class="title">Ordered Tree-Pushdown Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015.163">10.4230/LIPIcs.FSTTCS.2015.163</a>
</li>
<li>
<span class="authors">Félix Baschenis, Olivier Gauwin, Anca Muscholl, and Gabriele Puppis</span>
<span class="title">One-way Definability of Sweeping Transducer</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015.178">10.4230/LIPIcs.FSTTCS.2015.178</a>
</li>
<li>
<span class="authors">Parosh Aziz Abdulla, Mohamed Faouzi Atig, Roland Meyer, and Mehdi Seyed Salehi</span>
<span class="title">What's Decidable about Availability Languages?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015.192">10.4230/LIPIcs.FSTTCS.2015.192</a>
</li>
<li>
<span class="authors">Sagnik Mukhopadhyay and Swagato Sanyal</span>
<span class="title">Towards Better Separation between Deterministic and Randomized Query Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015.206">10.4230/LIPIcs.FSTTCS.2015.206</a>
</li>
<li>
<span class="authors">Manindra Agrawal, Diptarka Chakraborty, Debarati Das, and Satyadev Nandakumar</span>
<span class="title">Dimension, Pseudorandomness and Extraction of Pseudorandomness</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015.221">10.4230/LIPIcs.FSTTCS.2015.221</a>
</li>
<li>
<span class="authors">John M. Hitchcock and A. Pavan</span>
<span class="title">On the NP-Completeness of the Minimum Circuit Size Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015.236">10.4230/LIPIcs.FSTTCS.2015.236</a>
</li>
<li>
<span class="authors">Nikhil Balaji, Samir Datta, and Venkatesh Ganesan</span>
<span class="title">Counting Euler Tours in Undirected Bounded Treewidth Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015.246">10.4230/LIPIcs.FSTTCS.2015.246</a>
</li>
<li>
<span class="authors">Shibashis Guha, Shankara Narayanan Krishna, Lakshmi Manasa, and Ashutosh Trivedi</span>
<span class="title">Revisiting Robustness in Priced Timed Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015.261">10.4230/LIPIcs.FSTTCS.2015.261</a>
</li>
<li>
<span class="authors">Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, and Benjamin Monmege</span>
<span class="title">Simple Priced Timed Games are not That Simple</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015.278">10.4230/LIPIcs.FSTTCS.2015.278</a>
</li>
<li>
<span class="authors">Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege, Guillermo A. Pérez, and Gabriel Renault</span>
<span class="title">Quantitative Games under Failures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015.293">10.4230/LIPIcs.FSTTCS.2015.293</a>
</li>
<li>
<span class="authors">Dietmar Berwanger and Marie van den Bogaard</span>
<span class="title">Games with Delays - A Frankenstein Approach</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015.307">10.4230/LIPIcs.FSTTCS.2015.307</a>
</li>
<li>
<span class="authors">Sudip Biswas, Arnab Ganguly, Rahul Shah, and Sharma V. Thankachan</span>
<span class="title">Forbidden Extension Queries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015.320">10.4230/LIPIcs.FSTTCS.2015.320</a>
</li>
<li>
<span class="authors">Arijit Bishnu, Amit Chakrabarti, Subhas C. Nandy, and Sandeep Sen</span>
<span class="title">On Density, Threshold and Emptiness Queries for Intervals in the Streaming Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015.336">10.4230/LIPIcs.FSTTCS.2015.336</a>
</li>
<li>
<span class="authors">Vladimir Braverman, Harry Lang, Keith Levin, and Morteza Monemizadeh</span>
<span class="title">Clustering on Sliding Windows in Polylogarithmic Space</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015.350">10.4230/LIPIcs.FSTTCS.2015.350</a>
</li>
<li>
<span class="authors">Guy Avni, Orna Kupferman, and Tami Tamir</span>
<span class="title">Congestion Games with Multisets of Resources and Applications in Synthesis</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015.365">10.4230/LIPIcs.FSTTCS.2015.365</a>
</li>
<li>
<span class="authors">Shaull Almagor, Denis Kuperberg, and Orna Kupferman</span>
<span class="title">The Sensing Cost of Monitoring and Synthesis</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015.380">10.4230/LIPIcs.FSTTCS.2015.380</a>
</li>
<li>
<span class="authors">David Cachera, Uli Fahrenberg, and Axel Legay</span>
<span class="title">An omega-Algebra for Real-Time Energy Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015.394">10.4230/LIPIcs.FSTTCS.2015.394</a>
</li>
<li>
<span class="authors">Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, and Alexander S. Kulikov</span>
<span class="title">Parameterized Complexity of Secluded Connectivity Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015.408">10.4230/LIPIcs.FSTTCS.2015.408</a>
</li>
<li>
<span class="authors">Sudeshna Kolay and Fahad Panolan</span>
<span class="title">Parameterized Algorithms for Deletion to (r,ell)-Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015.420">10.4230/LIPIcs.FSTTCS.2015.420</a>
</li>
<li>
<span class="authors">Prachi Goyal, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, and Saket Saurabh</span>
<span class="title">Finding Even Subgraphs Even Faster</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015.434">10.4230/LIPIcs.FSTTCS.2015.434</a>
</li>
<li>
<span class="authors">Till Fluschnik, Stefan Kratsch, Rolf Niedermeier, and Manuel Sorge</span>
<span class="title">The Parameterized Complexity of the Minimum Shared Edges Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015.448">10.4230/LIPIcs.FSTTCS.2015.448</a>
</li>
<li>
<span class="authors">Daniel J. Fremont, Alexandre Donzé, Sanjit A. Seshia, and David Wessel</span>
<span class="title">Control Improvisation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015.463">10.4230/LIPIcs.FSTTCS.2015.463</a>
</li>
<li>
<span class="authors">Chung-Kil Hur, Aditya V. Nori, Sriram K. Rajamani, and Selva Samuel</span>
<span class="title">A Provably Correct Sampler for Probabilistic Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015.475">10.4230/LIPIcs.FSTTCS.2015.475</a>
</li>
<li>
<span class="authors">Henryk Michalewski and Matteo Mio</span>
<span class="title">On the Problem of Computing the Probability of Regular Sets of Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015.489">10.4230/LIPIcs.FSTTCS.2015.489</a>
</li>
<li>
<span class="authors">Thomas Weidner</span>
<span class="title">Probabilistic Regular Expressions and MSO Logic on Finite Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015.503">10.4230/LIPIcs.FSTTCS.2015.503</a>
</li>
<li>
<span class="authors">Jennifer Iglesias, Rajmohan Rajaraman, R. Ravi, and Ravi Sundaram</span>
<span class="title">Rumors Across Radio, Wireless, Telephone</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015.517">10.4230/LIPIcs.FSTTCS.2015.517</a>
</li>
<li>
<span class="authors">Magnús M. Halldórsson and Tigran Tonoyan</span>
<span class="title">The Price of Local Power Control in Wireless Scheduling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015.529">10.4230/LIPIcs.FSTTCS.2015.529</a>
</li>
<li>
<span class="authors">Leonard J. Schulman and Vijay V. Vazirani</span>
<span class="title">Allocation of Divisible Goods Under Lexicographic Preferences</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015.543">10.4230/LIPIcs.FSTTCS.2015.543</a>
</li>
<li>
<span class="authors">Romain Demangeon and Nobuko Yoshida</span>
<span class="title">On the Expressiveness of Multiparty Sessions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015.560">10.4230/LIPIcs.FSTTCS.2015.560</a>
</li>
<li>
<span class="authors">Vincent Cheval, Véronique Cortier, and Eric le Morvan</span>
<span class="title">Secure Refinements of Communication Channels</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015.575">10.4230/LIPIcs.FSTTCS.2015.575</a>
</li>
<li>
<span class="authors">David Basin, Felix Klaedtke, and Eugen Zalinescu</span>
<span class="title">Failure-aware Runtime Verification of Distributed Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2015.590">10.4230/LIPIcs.FSTTCS.2015.590</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