<h2>LIPIcs, Volume 4, FSTTCS 2009</h2>
<ul>
<li>
<span class="authors">Ravi Kannan and K. Narayan Kumar</span>
<span class="title">LIPIcs, Volume 4, FSTTCS'09, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2009">10.4230/LIPIcs.FSTTCS.2009</a>
</li>
<li>
<span class="authors">Ravi Kannan and K. Narayan Kumar</span>
<span class="title">Preface -- IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (2009)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2341">10.4230/LIPIcs.FSTTCS.2009.2341</a>
</li>
<li>
<span class="authors">Parosh A. Abdulla, Yu-Fang Chen, Lukas Holik, and Tomas Vojnar</span>
<span class="title">Mediating for Reduction (on Minimizing Alternating Büchi Automata)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2302">10.4230/LIPIcs.FSTTCS.2009.2302</a>
</li>
<li>
<span class="authors">Mostafa Ammar, Deeparnab Chakrabarty, Atish Das Sarma, Subrahmanyam Kalyanasundaram, and Richard J. Lipton</span>
<span class="title">Algorithms for Message Ferrying on Mobile ad hoc Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2303">10.4230/LIPIcs.FSTTCS.2009.2303</a>
</li>
<li>
<span class="authors">Vikraman Arvind, Pushkar S. Joglekar, and Srikanth Srinivasan</span>
<span class="title">Arithmetic Circuits and the Hadamard Product of Polynomials</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2304">10.4230/LIPIcs.FSTTCS.2009.2304</a>
</li>
<li>
<span class="authors">Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, and Stéphan Thomassé</span>
<span class="title">Kernels for Feedback Arc Set In Tournaments</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2305">10.4230/LIPIcs.FSTTCS.2009.2305</a>
</li>
<li>
<span class="authors">Tomas Brazdil, Javier Esparza, and Stefan Kiefer</span>
<span class="title">On the Memory Consumption of Probabilistic Pushdown Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2306">10.4230/LIPIcs.FSTTCS.2009.2306</a>
</li>
<li>
<span class="authors">Tomas Brazdil, Vojtech Forejt, Jan Krcal, Jan Kretinsky, and Antonin Kucera</span>
<span class="title">Continuous-Time Stochastic Games with Time-Bounded Reachability</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2307">10.4230/LIPIcs.FSTTCS.2009.2307</a>
</li>
<li>
<span class="authors">Mikolaj Bojanczyk and Szymon Torunczyk</span>
<span class="title">Deterministic Automata and Extensions of Weak MSO</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2308">10.4230/LIPIcs.FSTTCS.2009.2308</a>
</li>
<li>
<span class="authors">Laura Bozzelli, Axel Legay, and Sophie Pinchinat</span>
<span class="title">On Timed Alternating Simulation for Concurrent Timed Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2309">10.4230/LIPIcs.FSTTCS.2009.2309</a>
</li>
<li>
<span class="authors">Laurent Braud</span>
<span class="title">Covering of ordinals</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2310">10.4230/LIPIcs.FSTTCS.2009.2310</a>
</li>
<li>
<span class="authors">Mark Braverman, Stephen Cook, Pierre McKenzie, Rahul Santhanam, and Dustin Wehr</span>
<span class="title">Fractional Pebbling and Thrifty Branching Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2311">10.4230/LIPIcs.FSTTCS.2009.2311</a>
</li>
<li>
<span class="authors">Jérémie Cabessa, Jacques Duparc, Alessandro Facchini, and Filip Murlak</span>
<span class="title">The Wadge Hierarchy of Max-Regular Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2312">10.4230/LIPIcs.FSTTCS.2009.2312</a>
</li>
<li>
<span class="authors">Julien Cristau</span>
<span class="title">Automata and temporal logic over arbitrary linear time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2313">10.4230/LIPIcs.FSTTCS.2009.2313</a>
</li>
<li>
<span class="authors">Samir Datta, Prajakta Nimbhorkar, Thomas Thierauf, and Fabian Wagner</span>
<span class="title">Graph Isomorphism for K_{3,3}-free and K_5-free graphs is in Log-space</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2314">10.4230/LIPIcs.FSTTCS.2009.2314</a>
</li>
<li>
<span class="authors">Anuj Dawar and Stephan Kreutzer</span>
<span class="title">Domination Problems in Nowhere-Dense Classes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2315">10.4230/LIPIcs.FSTTCS.2009.2315</a>
</li>
<li>
<span class="authors">Stéphanie Delaune, Steve Kremer, and Olivier Pereira</span>
<span class="title">Simulation based security in the applied pi calculus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2316">10.4230/LIPIcs.FSTTCS.2009.2316</a>
</li>
<li>
<span class="authors">Stéphane Demri, Marcin Jurdzinski, Oded Lachish, and Ranko Lazic</span>
<span class="title">The Covering and Boundedness Problems for Branching Vector Addition Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2317">10.4230/LIPIcs.FSTTCS.2009.2317</a>
</li>
<li>
<span class="authors">Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, and Saket Saurabh</span>
<span class="title">Subexponential Algorithms for Partial Cover Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2318">10.4230/LIPIcs.FSTTCS.2009.2318</a>
</li>
<li>
<span class="authors">Konstantinos Georgiou, Avner Magen, and Iannis Tourlakis</span>
<span class="title">On the Tightening of the Standard SDP for Vertex Cover with $ell_1$ Inequalities</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2319">10.4230/LIPIcs.FSTTCS.2009.2319</a>
</li>
<li>
<span class="authors">John M. Hitchcock, Aduri Pavan, and N. V. Vinodchandran</span>
<span class="title">Kolmogorov Complexity in Randomness Extraction</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2320">10.4230/LIPIcs.FSTTCS.2009.2320</a>
</li>
<li>
<span class="authors">Chien-Chung Huang and Zoya Svitkina</span>
<span class="title">Donation Center Location Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2321">10.4230/LIPIcs.FSTTCS.2009.2321</a>
</li>
<li>
<span class="authors">Marc Kaplan, Iordanis Kerenidis, Sophie Laplante, and Jérémie Roland</span>
<span class="title">Non-Local Box Complexity and Secure Function Evaluation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2322">10.4230/LIPIcs.FSTTCS.2009.2322</a>
</li>
<li>
<span class="authors">Mark Kattenbelt and Michael Huth</span>
<span class="title">Verification and Refutation of Probabilistic Specifications via Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2323">10.4230/LIPIcs.FSTTCS.2009.2323</a>
</li>
<li>
<span class="authors">Rohit Khandekar, Guy Kortsarz, and Zeev Nutov</span>
<span class="title">Approximating Fault-Tolerant Group-Steiner Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2324">10.4230/LIPIcs.FSTTCS.2009.2324</a>
</li>
<li>
<span class="authors">Rohit Khandekar, Kirsten Hildrum, Sujay Parekh, Deepak Rajan, Jay Sethuraman, and Joel Wolf</span>
<span class="title">Bounded Size Graph Clustering with Applications to Stream Processing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2325">10.4230/LIPIcs.FSTTCS.2009.2325</a>
</li>
<li>
<span class="authors">Joachim Kneis, Alexander Langer, and Peter Rossmanith</span>
<span class="title">A Fine-grained Analysis of a Simple Independent Set Algorithm</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2326">10.4230/LIPIcs.FSTTCS.2009.2326</a>
</li>
<li>
<span class="authors">Abhinav Kumar, Satyanarayana V. Lokam, Vijay M. Patankar, and Jayalal Sarma M. N.</span>
<span class="title">Using Elimination Theory to construct Rigid Matrices</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2327">10.4230/LIPIcs.FSTTCS.2009.2327</a>
</li>
<li>
<span class="authors">Christof Löding and Karianto Wong</span>
<span class="title">On Nondeterministic Unranked Tree Automata with Sibling Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2328">10.4230/LIPIcs.FSTTCS.2009.2328</a>
</li>
<li>
<span class="authors">André Madeira and S. Muthukrishnan</span>
<span class="title">Functionally Private Approximations of Negligibly-Biased Estimators</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2329">10.4230/LIPIcs.FSTTCS.2009.2329</a>
</li>
<li>
<span class="authors">Soumya Paul and Sunil Simon</span>
<span class="title">Nash Equilibrium in Generalised Muller Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2330">10.4230/LIPIcs.FSTTCS.2009.2330</a>
</li>
<li>
<span class="authors">M. Praveen and Kamal Lodaya</span>
<span class="title">Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2331">10.4230/LIPIcs.FSTTCS.2009.2331</a>
</li>
<li>
<span class="authors">Alexander Rabinovich</span>
<span class="title">Synthesis of Finite-state and Definable Winning Strategies</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2332">10.4230/LIPIcs.FSTTCS.2009.2332</a>
</li>
<li>
<span class="authors">Chandan Saha, Ramprasad Saptharishi, and Nitin Saxena</span>
<span class="title">The Power of Depth 2 Circuits over Algebras</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2333">10.4230/LIPIcs.FSTTCS.2009.2333</a>
</li>
<li>
<span class="authors">Ankur Taly and Ashish Tiwari</span>
<span class="title">Deductive Verification of Continuous Dynamical Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2334">10.4230/LIPIcs.FSTTCS.2009.2334</a>
</li>
<li>
<span class="authors">Mathieu Tracol, Christel Baier, and Marcus Grösser</span>
<span class="title">Recurrence and Transience for Probabilistic Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2335">10.4230/LIPIcs.FSTTCS.2009.2335</a>
</li>
<li>
<span class="authors">Anuj Dawar</span>
<span class="title">Structure and Specification as Sources of Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2336">10.4230/LIPIcs.FSTTCS.2009.2336</a>
</li>
<li>
<span class="authors">Kim G. Larsen</span>
<span class="title">Priced Timed Automata: Theory and Tools</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2337">10.4230/LIPIcs.FSTTCS.2009.2337</a>
</li>
<li>
<span class="authors">Martin Odersky and Adriaan Moors</span>
<span class="title">Fighting bit Rot with Types (Experience Report: Scala Collections)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2338">10.4230/LIPIcs.FSTTCS.2009.2338</a>
</li>
<li>
<span class="authors">R. Ravi</span>
<span class="title">Iterative Methods in Combinatorial Optimization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2339">10.4230/LIPIcs.FSTTCS.2009.2339</a>
</li>
<li>
<span class="authors">Avi Wigderson</span>
<span class="title">Randomness extractors -- applications and constructions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2340">10.4230/LIPIcs.FSTTCS.2009.2340</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