<h2>LIPIcs, Volume 2, FSTTCS 2008</h2>
<ul>
<li>
<span class="authors">Ramesh Hariharan, Madhavan Mukund, and V Vinay</span>
<span class="title">LIPIcs, Volume 2, FSTTCS'08, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2008">10.4230/LIPIcs.FSTTCS.2008</a>
</li>
<li>
<span class="authors">Ramesh Hariharan, Madhavan Mukund, and V Vinay</span>
<span class="title">2008 Abstracts Collection -- IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1772">10.4230/LIPIcs.FSTTCS.2008.1772</a>
</li>
<li>
<span class="authors">Ramesh Hariharan, Madhavan Mukund, and V Vinay</span>
<span class="title">2008 Preface -- IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1771">10.4230/LIPIcs.FSTTCS.2008.1771</a>
</li>
<li>
<span class="authors">Samir Datta, Nutan Limaye, and Prajakta Nimbhorkar</span>
<span class="title">3-connected Planar Graph Isomorphism is in Log-space</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1749">10.4230/LIPIcs.FSTTCS.2008.1749</a>
</li>
<li>
<span class="authors">Christian Komusiewicz and Johannes Uhlmann</span>
<span class="title">A Cubic-Vertex Kernel for Flip Consensus Tree</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1760">10.4230/LIPIcs.FSTTCS.2008.1760</a>
</li>
<li>
<span class="authors">Juan Rodriguez-Hortala</span>
<span class="title">A Hierarchy of Semantics for Non-deterministic Term Rewriting Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1764">10.4230/LIPIcs.FSTTCS.2008.1764</a>
</li>
<li>
<span class="authors">Alan Frieze and Ravi Kannan</span>
<span class="title">A new approach to the planted clique problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1752">10.4230/LIPIcs.FSTTCS.2008.1752</a>
</li>
<li>
<span class="authors">Josep Diaz, Lefteris Kirousis, Dieter Mitsche, and Xavier Perez-Gimenez</span>
<span class="title">A new upper bound for 3-SAT</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1750">10.4230/LIPIcs.FSTTCS.2008.1750</a>
</li>
<li>
<span class="authors">Hubert Comon-Lundh</span>
<span class="title">About models of security protocols</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1766">10.4230/LIPIcs.FSTTCS.2008.1766</a>
</li>
<li>
<span class="authors">Rayna Dimitrova and Bernd Finkbeiner</span>
<span class="title">Abstraction Refinement for Games with Incomplete Information</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1751">10.4230/LIPIcs.FSTTCS.2008.1751</a>
</li>
<li>
<span class="authors">Krishnendu Chatterjee, Luca de Alfaro, Rupak Majumdar, and Vishwanath Raman</span>
<span class="title">Algorithms for Game Metrics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1745">10.4230/LIPIcs.FSTTCS.2008.1745</a>
</li>
<li>
<span class="authors">Daniel Golovin, Anupam Gupta, Amit Kumar, and Kanat Tangwongsan</span>
<span class="title">All-Norms and All-L_p-Norms Approximation Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1753">10.4230/LIPIcs.FSTTCS.2008.1753</a>
</li>
<li>
<span class="authors">Stefan Gulan and Henning Fernau</span>
<span class="title">An Optimal Construction of Finite Automata from Regular Expressions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1754">10.4230/LIPIcs.FSTTCS.2008.1754</a>
</li>
<li>
<span class="authors">Mohamed Faouzi Atig, Ahmed Bouajjani, and Tayssir Touili</span>
<span class="title">Analyzing Asynchronous Programs with Preemption</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1739">10.4230/LIPIcs.FSTTCS.2008.1739</a>
</li>
<li>
<span class="authors">Jean-Yves Marion and Romain Pechoux</span>
<span class="title">Analyzing the Implicit Computational Complexity of object-oriented programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1763">10.4230/LIPIcs.FSTTCS.2008.1763</a>
</li>
<li>
<span class="authors">Marcin Jurdzinski and Ashutosh Trivedi</span>
<span class="title">Average-Time Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1765">10.4230/LIPIcs.FSTTCS.2008.1765</a>
</li>
<li>
<span class="authors">Erich Graedel</span>
<span class="title">Banach-Mazur Games on Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1768">10.4230/LIPIcs.FSTTCS.2008.1768</a>
</li>
<li>
<span class="authors">Didier Caucal</span>
<span class="title">Boolean algebras of unambiguous context-free languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1743">10.4230/LIPIcs.FSTTCS.2008.1743</a>
</li>
<li>
<span class="authors">Georg Moser, Andreas Schnabl, and Johannes Waldmann</span>
<span class="title">Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1762">10.4230/LIPIcs.FSTTCS.2008.1762</a>
</li>
<li>
<span class="authors">Telikepalli Kavitha</span>
<span class="title">Dynamic matrix rank with partial lookahead</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1759">10.4230/LIPIcs.FSTTCS.2008.1759</a>
</li>
<li>
<span class="authors">Florian Horn</span>
<span class="title">Explicit Muller Games are PTIME</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1756">10.4230/LIPIcs.FSTTCS.2008.1756</a>
</li>
<li>
<span class="authors">Julien Cristau and Florian Horn</span>
<span class="title">Graph Games on Ordinals</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1748">10.4230/LIPIcs.FSTTCS.2008.1748</a>
</li>
<li>
<span class="authors">Simon Peyton Jones, Roman Leshchinskiy, Gabriele Keller, and Manuel M T Chakravarty</span>
<span class="title">Harnessing the Multicores: Nested Data Parallelism in Haskell</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1769">10.4230/LIPIcs.FSTTCS.2008.1769</a>
</li>
<li>
<span class="authors">Omid Amini, Fedor Fomin, and Saket Saurabh</span>
<span class="title">Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1736">10.4230/LIPIcs.FSTTCS.2008.1736</a>
</li>
<li>
<span class="authors">Andre Chailloux and Iordanis Kerenidis</span>
<span class="title">Increasing the power of the verifier in Quantum Zero Knowledge</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1744">10.4230/LIPIcs.FSTTCS.2008.1744</a>
</li>
<li>
<span class="authors">Leslie G Valiant</span>
<span class="title">Knowledge Infusion: In Pursuit of Robustness in Artificial Intelligence</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1770">10.4230/LIPIcs.FSTTCS.2008.1770</a>
</li>
<li>
<span class="authors">Markus Lohrey</span>
<span class="title">Leaf languages and string compression</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1761">10.4230/LIPIcs.FSTTCS.2008.1761</a>
</li>
<li>
<span class="authors">Uriel Feige</span>
<span class="title">On Estimation Algorithms vs Approximation Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1767">10.4230/LIPIcs.FSTTCS.2008.1767</a>
</li>
<li>
<span class="authors">Dietmar Berwanger and Laurent Doyen</span>
<span class="title">On the Power of Imperfect Information</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1742">10.4230/LIPIcs.FSTTCS.2008.1742</a>
</li>
<li>
<span class="authors">Chandra Chekuri and Nitish Korula</span>
<span class="title">Pruning 2-Connected Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1746">10.4230/LIPIcs.FSTTCS.2008.1746</a>
</li>
<li>
<span class="authors">David Basin, Felix Klaedtke, Samuel Müller, and Birgit Pfitzmann</span>
<span class="title">Runtime Monitoring of Metric First-order Temporal Properties</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1740">10.4230/LIPIcs.FSTTCS.2008.1740</a>
</li>
<li>
<span class="authors">Chandra Chekuri and Nitish Korula</span>
<span class="title">Single-Sink Network Design with Vertex Connectivity Requirements</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1747">10.4230/LIPIcs.FSTTCS.2008.1747</a>
</li>
<li>
<span class="authors">Noam Berger, Nevin Kapur, Leonard Schulman, and Vijay Vazirani</span>
<span class="title">Solvency Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1741">10.4230/LIPIcs.FSTTCS.2008.1741</a>
</li>
<li>
<span class="authors">V. Arvind and Pushkar S. Joglekar</span>
<span class="title">Some Sieving Algorithms for Lattice Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1738">10.4230/LIPIcs.FSTTCS.2008.1738</a>
</li>
<li>
<span class="authors">Takahito Aoto</span>
<span class="title">Sound Lemma Generation for Proving Inductive Validity of Equations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1737">10.4230/LIPIcs.FSTTCS.2008.1737</a>
</li>
<li>
<span class="authors">Sampath Kannan, Sanjeev Khanna, and Sudeepa Roy</span>
<span class="title">STCON in Directed Unique-Path Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1758">10.4230/LIPIcs.FSTTCS.2008.1758</a>
</li>
<li>
<span class="authors">Kazuhiro Inaba and Sebastian Maneth</span>
<span class="title">The Complexity of Tree Transducer Output Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1757">10.4230/LIPIcs.FSTTCS.2008.1757</a>
</li>
<li>
<span class="authors">Jonathan Hayman and Glynn Winskel</span>
<span class="title">The unfolding of general Petri nets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1755">10.4230/LIPIcs.FSTTCS.2008.1755</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