<h2>LIPIcs, Volume 24, FSTTCS 2013</h2>
<ul>
<li>
<span class="authors">Anil Seth and Nisheeth K. Vishnoi</span>
<span class="title">LIPIcs, Volume 24, FSTTCS'13, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2013">10.4230/LIPIcs.FSTTCS.2013</a>
</li>
<li>
<span class="authors">Anil Seth and Nisheeth K. Vishnoi</span>
<span class="title">Frontmatter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2013.i">10.4230/LIPIcs.FSTTCS.2013.i</a>
</li>
<li>
<span class="authors">Venkatesan Guruswami</span>
<span class="title">Polar Codes: Reliable Communication with Complexity Polynomial in the Gap to Shannon Capacity (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2013.1">10.4230/LIPIcs.FSTTCS.2013.1</a>
</li>
<li>
<span class="authors">Martin Hofmann and Ramyaa Ramyaa</span>
<span class="title">Computing With a Fixed Number of Pointers (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2013.3">10.4230/LIPIcs.FSTTCS.2013.3</a>
</li>
<li>
<span class="authors">Subhash Khot</span>
<span class="title">On Approximation Resistance of Predicates (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2013.19">10.4230/LIPIcs.FSTTCS.2013.19</a>
</li>
<li>
<span class="authors">Martin Grohe, Stephan Kreutzer, and Sebastian Siebertz</span>
<span class="title">Characterisations of Nowhere Dense Graphs (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2013.21">10.4230/LIPIcs.FSTTCS.2013.21</a>
</li>
<li>
<span class="authors">Kazushige Terui</span>
<span class="title">Intersection Types for Normalization and Verification (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2013.41">10.4230/LIPIcs.FSTTCS.2013.41</a>
</li>
<li>
<span class="authors">Robert Crowston, Mark Jones, Gabriele Muciaccia, Geevarghese Philip, Ashutosh Rai, and Saket Saurabh</span>
<span class="title">Polynomial Kernels for lambda-extendible Properties Parameterized Above the Poljak-Turzik Bound</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2013.43">10.4230/LIPIcs.FSTTCS.2013.43</a>
</li>
<li>
<span class="authors">Henning Fernau, Markus L. Schmid, and Yngve Villanger</span>
<span class="title">On the Parameterised Complexity of String Morphism Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2013.55">10.4230/LIPIcs.FSTTCS.2013.55</a>
</li>
<li>
<span class="authors">Manu Basavaraju, Mathew C. Francis, M. S. Ramanujan, and Saket Saurabh</span>
<span class="title">Partially Polynomial Kernels for Set Cover and Test Cover</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2013.67">10.4230/LIPIcs.FSTTCS.2013.67</a>
</li>
<li>
<span class="authors">Rajesh Chitnis, Fedor V. Fomin, and Petr A. Golovach</span>
<span class="title">Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2013.79">10.4230/LIPIcs.FSTTCS.2013.79</a>
</li>
<li>
<span class="authors">Pierre Clairambault and Andrzej S. Murawski</span>
<span class="title">Böhm Trees as Higher-Order Recursive Schemes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2013.91">10.4230/LIPIcs.FSTTCS.2013.91</a>
</li>
<li>
<span class="authors">Sylvain Salvati and Igor Walukiewicz</span>
<span class="title">Evaluation is MSOL-compatible</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2013.103">10.4230/LIPIcs.FSTTCS.2013.103</a>
</li>
<li>
<span class="authors">Axel Haddad</span>
<span class="title">Model Checking and Functional Program Transformations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2013.115">10.4230/LIPIcs.FSTTCS.2013.115</a>
</li>
<li>
<span class="authors">Georgel Calin, Egor Derevenetc, Rupak Majumdar, and Roland Meyer</span>
<span class="title">A Theory of Partitioned Global Address Spaces</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2013.127">10.4230/LIPIcs.FSTTCS.2013.127</a>
</li>
<li>
<span class="authors">Prahladh Harsha and Rahul Jain</span>
<span class="title">A Strong Direct Product Theorem for the Tribes Function via the Smooth-Rectangle Bound</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2013.141">10.4230/LIPIcs.FSTTCS.2013.141</a>
</li>
<li>
<span class="authors">L. Sunil Chandran and Deepak Rajendraprasad</span>
<span class="title">Inapproximability of Rainbow Colouring</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2013.153">10.4230/LIPIcs.FSTTCS.2013.153</a>
</li>
<li>
<span class="authors">Anguraj Baskar, Prasad Naldurg, K. R. Raghavendra, and S. P. Suresh</span>
<span class="title">Primal Infon Logic: Derivability in Polynomial Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2013.163">10.4230/LIPIcs.FSTTCS.2013.163</a>
</li>
<li>
<span class="authors">Igor Potapov</span>
<span class="title">Composition Problems for Braids</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2013.175">10.4230/LIPIcs.FSTTCS.2013.175</a>
</li>
<li>
<span class="authors">Andreas Krebs and Nutan Limaye</span>
<span class="title">DLOGTIME Proof Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2013.189">10.4230/LIPIcs.FSTTCS.2013.189</a>
</li>
<li>
<span class="authors">Srikanth Srinivasan</span>
<span class="title">On Improved Degree Lower Bounds for Polynomial Approximation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2013.201">10.4230/LIPIcs.FSTTCS.2013.201</a>
</li>
<li>
<span class="authors">S. Akshay, Ionut Dinca, Blaise Genest, and Alin Stefanescu</span>
<span class="title">Implementing Realistic Asynchronous Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2013.213">10.4230/LIPIcs.FSTTCS.2013.213</a>
</li>
<li>
<span class="authors">Javier Esparza, Loig Jezequel, and Stefan Schwoon</span>
<span class="title">Computation of Summaries Using Net Unfoldings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2013.225">10.4230/LIPIcs.FSTTCS.2013.225</a>
</li>
<li>
<span class="authors">Prachi Goyal, Neeldhara Misra, and Fahad Panolan</span>
<span class="title">Faster Deterministic Algorithms for r-Dimensional Matching Using Representative Sets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2013.237">10.4230/LIPIcs.FSTTCS.2013.237</a>
</li>
<li>
<span class="authors">Archita Agarwal, Venkatesan T. Chakaravarthy, Anamitra Roy Choudhury, Sambuddha Roy, and Yogish Sabharwal</span>
<span class="title">Distributed and Parallel Algorithms for Set Cover Problems with Small Neighborhood Covers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2013.249">10.4230/LIPIcs.FSTTCS.2013.249</a>
</li>
<li>
<span class="authors">Sonika Arora, Venkatesan T. Chakaravarthy, Neelima Gupta, Koyel Mukherjee, and Yogish Sabharwal</span>
<span class="title">Replica Placement via Capacitated Vertex Cover</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2013.263">10.4230/LIPIcs.FSTTCS.2013.263</a>
</li>
<li>
<span class="authors">Venkatesan T. Chakaravarthy, Anamitra Roy Choudhury, Sivaramakrishnan R. Natarajan, and Sambuddha Roy</span>
<span class="title">Knapsack Cover Subject to a Matroid Constraint</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2013.275">10.4230/LIPIcs.FSTTCS.2013.275</a>
</li>
<li>
<span class="authors">Bastien Maubert and Sophie Pinchinat</span>
<span class="title">Jumping Automata for Uniform Strategies</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2013.287">10.4230/LIPIcs.FSTTCS.2013.287</a>
</li>
<li>
<span class="authors">Nathanaël Fijalkow, Sophie Pinchinat, and Olivier Serre</span>
<span class="title">Emptiness Of Alternating Tree Automata Using Games With Imperfect Information</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2013.299">10.4230/LIPIcs.FSTTCS.2013.299</a>
</li>
<li>
<span class="authors">Matthew Hague</span>
<span class="title">Saturation of Concurrent Collapsible Pushdown Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2013.313">10.4230/LIPIcs.FSTTCS.2013.313</a>
</li>
<li>
<span class="authors">Christof Löding and Stefan Repke</span>
<span class="title">Decidability Results on the Existence of Lookahead Delegators for NFA</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2013.327">10.4230/LIPIcs.FSTTCS.2013.327</a>
</li>
<li>
<span class="authors">Chien-Chung Huang, Telikepalli Kavitha, Kurt Mehlhorn, and Dimitrios Michail</span>
<span class="title">Fair Matchings and Related Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2013.339">10.4230/LIPIcs.FSTTCS.2013.339</a>
</li>
<li>
<span class="authors">Jian Li and Zeyu Zhang</span>
<span class="title">Ranking with Diverse Intents and Correlated Contents</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2013.351">10.4230/LIPIcs.FSTTCS.2013.351</a>
</li>
<li>
<span class="authors">Thomas Place, Lorijn van Rooijen, and Marc Zeitoun</span>
<span class="title">Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2013.363">10.4230/LIPIcs.FSTTCS.2013.363</a>
</li>
<li>
<span class="authors">Andreas Holzer, Christian Schallhart, Michael Tautschnig, and Helmut Veith</span>
<span class="title">On the Structure and Complexity of Rational Sets of Regular Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2013.377">10.4230/LIPIcs.FSTTCS.2013.377</a>
</li>
<li>
<span class="authors">Mario E. Consuegra and Giri Narasimhan</span>
<span class="title">Geometric Avatar Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2013.389">10.4230/LIPIcs.FSTTCS.2013.389</a>
</li>
<li>
<span class="authors">Parinya Chalermsook and Suresh Venkatasubramanian</span>
<span class="title">Clustering With Center Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2013.401">10.4230/LIPIcs.FSTTCS.2013.401</a>
</li>
<li>
<span class="authors">Tim Smith</span>
<span class="title">On Infinite Words Determined by Stack Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2013.413">10.4230/LIPIcs.FSTTCS.2013.413</a>
</li>
<li>
<span class="authors">Olivier Bodini, Antoine Genitrini, and Frédéric Peschanski</span>
<span class="title">The Combinatorics of Non-determinism</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2013.425">10.4230/LIPIcs.FSTTCS.2013.425</a>
</li>
<li>
<span class="authors">Barna Saha</span>
<span class="title">Renting a Cloud</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2013.437">10.4230/LIPIcs.FSTTCS.2013.437</a>
</li>
<li>
<span class="authors">Evripidis Bampis, Alexander Kononov, Dimitrios Letsios, Giorgio Lucarelli, and Maxim Sviridenko</span>
<span class="title">Energy Efficient Scheduling and Routing via Randomized Rounding</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2013.449">10.4230/LIPIcs.FSTTCS.2013.449</a>
</li>
<li>
<span class="authors">Kamyar Khodamoradi, Ramesh Krishnamurti, Arash Rafiey, and Georgios Stamoulis</span>
<span class="title">PTAS for Ordered Instances of Resource Allocation Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2013.461">10.4230/LIPIcs.FSTTCS.2013.461</a>
</li>
<li>
<span class="authors">Florin Manea, Mike Müller, and Dirk Nowotka</span>
<span class="title">On the Pseudoperiodic Extension of u^l = v^m w^n</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2013.475">10.4230/LIPIcs.FSTTCS.2013.475</a>
</li>
<li>
<span class="authors">Tomás Brázdil, Taolue Chen, Vojtech Forejt, Petr Novotný, and Aistis Simaitis</span>
<span class="title">Solvency Markov Decision Processes with Interest</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2013.487">10.4230/LIPIcs.FSTTCS.2013.487</a>
</li>
<li>
<span class="authors">Nathalie Bertrand and Paulin Fournier</span>
<span class="title">Parameterized Verification of Many Identical Probabilistic Timed Processes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2013.501">10.4230/LIPIcs.FSTTCS.2013.501</a>
</li>
<li>
<span class="authors">Piotr Hofman, Slawomir Lasota, Richard Mayr, and Patrick Totzke</span>
<span class="title">Simulation Over One-counter Nets is PSPACE-Complete</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2013.515">10.4230/LIPIcs.FSTTCS.2013.515</a>
</li>
<li>
<span class="authors">Stefan Haar, Serge Haddad, Tarek Melliti, and Stefan Schwoon</span>
<span class="title">Optimal Constructions for Active Diagnosis</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2013.527">10.4230/LIPIcs.FSTTCS.2013.527</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