<h2>LIPIcs, Volume 3, STACS 2009</h2>
<ul>
<li>
<span class="authors">Susanne Albers and Jean-Yves Marion</span>
<span class="title">LIPIcs, Volume 3, STACS'09, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009">10.4230/LIPIcs.STACS.2009</a>
</li>
<li>
<span class="authors">Susanne Albers and Jean-Yves Marion</span>
<span class="title">Preface -- 26th International Symposium on Theoretical Aspects of Computer Science</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1858">10.4230/LIPIcs.STACS.2009.1858</a>
</li>
<li>
<span class="authors">Eda Baykan, Monika Henzinger, Stefan F. Keller, Sebastian de Castelberg, and Markus Kinzler</span>
<span class="title">A Comparison of Techniques for Sampling Web Pages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1809">10.4230/LIPIcs.STACS.2009.1809</a>
</li>
<li>
<span class="authors">Jean-Eric Pin</span>
<span class="title">Profinite Methods in Automata Theory</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1856">10.4230/LIPIcs.STACS.2009.1856</a>
</li>
<li>
<span class="authors">Nicole Schweikardt</span>
<span class="title">Lower Bounds for Multi-Pass Processing of Multiple Data Streams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1857">10.4230/LIPIcs.STACS.2009.1857</a>
</li>
<li>
<span class="authors">Mustaq Ahmed and Anna Lubiw</span>
<span class="title">Shortest Paths Avoiding Forbidden Subpaths</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1831">10.4230/LIPIcs.STACS.2009.1831</a>
</li>
<li>
<span class="authors">Joel Alwen and Chris Peikert</span>
<span class="title">Generating Shorter Bases for Hard Random Lattices</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1832">10.4230/LIPIcs.STACS.2009.1832</a>
</li>
<li>
<span class="authors">Vikraman Arvind and Partha Mukhopadhyay</span>
<span class="title">Quantum Query Complexity of Multilinear Identity Testing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1801">10.4230/LIPIcs.STACS.2009.1801</a>
</li>
<li>
<span class="authors">Nathalie Aubrun and Mathieu Sablik</span>
<span class="title">An Order on Sets of Tilings Corresponding to an Order on Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1833">10.4230/LIPIcs.STACS.2009.1833</a>
</li>
<li>
<span class="authors">Jeremy Barbay and Gonzalo Navarro</span>
<span class="title">Compressed Representations of Permutations, and Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1814">10.4230/LIPIcs.STACS.2009.1814</a>
</li>
<li>
<span class="authors">Frederique Bassino, Julien David, and Cyril Nicaud</span>
<span class="title">On the Average Complexity of Moore's State Minimization Algorithm</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1822">10.4230/LIPIcs.STACS.2009.1822</a>
</li>
<li>
<span class="authors">Arnab Bhattacharyya, Victor Chen, Madhu Sudan, and Ning Xie</span>
<span class="title">Testing Linear-Invariant Non-Linear Properties</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1823">10.4230/LIPIcs.STACS.2009.1823</a>
</li>
<li>
<span class="authors">Laurent Bienvenu and Rod Downey</span>
<span class="title">Kolmogorov Complexity and Solovay Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1810">10.4230/LIPIcs.STACS.2009.1810</a>
</li>
<li>
<span class="authors">Mikolaj Bojanczyk</span>
<span class="title">Weak MSO with the Unbounding Quantifier</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1834">10.4230/LIPIcs.STACS.2009.1834</a>
</li>
<li>
<span class="authors">Glencora Borradaile, Erik D. Demaine, and Siamak Tazari</span>
<span class="title">Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1835">10.4230/LIPIcs.STACS.2009.1835</a>
</li>
<li>
<span class="authors">Nicolas Bousquet, Jean Daligault, Stephan Thomasse, and Anders Yeo</span>
<span class="title">A Polynomial Kernel for Multicut in Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1824">10.4230/LIPIcs.STACS.2009.1824</a>
</li>
<li>
<span class="authors">Laurent Boyer and Guillaume Theyssier</span>
<span class="title">On Local Symmetries and Universality in Cellular Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1836">10.4230/LIPIcs.STACS.2009.1836</a>
</li>
<li>
<span class="authors">Tomas Brazdil, Vaclav Brozek, Antonin Kucera, and Jan Obdrzalek</span>
<span class="title">Qualitative Reachability in Stochastic BPA Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1837">10.4230/LIPIcs.STACS.2009.1837</a>
</li>
<li>
<span class="authors">Jop Briet and Ronald de Wolf</span>
<span class="title">Locally Decodable Quantum Codes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1813">10.4230/LIPIcs.STACS.2009.1813</a>
</li>
<li>
<span class="authors">Andrei A. Bulatov, Victor Dalmau, Martin Grohe, and Daniel Marx</span>
<span class="title">Enumerating Homomorphisms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1838">10.4230/LIPIcs.STACS.2009.1838</a>
</li>
<li>
<span class="authors">Sourav Chakraborty, Eldar Fischer, Arie Matsliah, and Raphael Yuster</span>
<span class="title">Hardness and Algorithms for Rainbow Connectivity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1811">10.4230/LIPIcs.STACS.2009.1811</a>
</li>
<li>
<span class="authors">Ho-Leung Chan, Jeff Edmonds, Tak-Wah Lam, Lap-Kei Lee, Alberto Marchetti-Spaccamela, and Kirk Pruhs</span>
<span class="title">Nonclairvoyant Speed Scaling for Flow and Energy</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1815">10.4230/LIPIcs.STACS.2009.1815</a>
</li>
<li>
<span class="authors">Victor Chepoi and Morgan Seston</span>
<span class="title">An Approximation Algorithm for l_infinity Fitting Robinson Structures to Distances</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1816">10.4230/LIPIcs.STACS.2009.1816</a>
</li>
<li>
<span class="authors">Mahdi Cheraghchi and Amin Shokrollahi</span>
<span class="title">Almost-Uniform Sampling of Points on High-Dimensional Algebraic Varieties</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1817">10.4230/LIPIcs.STACS.2009.1817</a>
</li>
<li>
<span class="authors">Julien Clement, Maxime Crochemore, and Giuseppina Rindone</span>
<span class="title">Reverse Engineering Prefix Tables</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1825">10.4230/LIPIcs.STACS.2009.1825</a>
</li>
<li>
<span class="authors">Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, and Morteza Zadimoghaddam</span>
<span class="title">The Price of Anarchy in Cooperative Network Creation Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1839">10.4230/LIPIcs.STACS.2009.1839</a>
</li>
<li>
<span class="authors">Ronald de Wolf</span>
<span class="title">Error-Correcting Data Structures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1802">10.4230/LIPIcs.STACS.2009.1802</a>
</li>
<li>
<span class="authors">Volker Diekert and Manfred Kufleitner</span>
<span class="title">Fragments of First-Order Logic over Infinite Words</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1818">10.4230/LIPIcs.STACS.2009.1818</a>
</li>
<li>
<span class="authors">Pietro Di Lena and Luciano Margara</span>
<span class="title">Undecidable Properties of Limit Set Dynamics of Cellular Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1819">10.4230/LIPIcs.STACS.2009.1819</a>
</li>
<li>
<span class="authors">Tomas Ebenlendr and Jiri Sgall</span>
<span class="title">Semi-Online Preemptive Scheduling: One Algorithm for All Variants</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1840">10.4230/LIPIcs.STACS.2009.1840</a>
</li>
<li>
<span class="authors">Khaled Elbassioni, Erik Krohn, Domagoj Matijevic, Julian Mestre, and Domagoj Severdija</span>
<span class="title">Improved Approximations for Guarding 1.5-Dimensional Terrains</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1841">10.4230/LIPIcs.STACS.2009.1841</a>
</li>
<li>
<span class="authors">Robert Elsässer and Thomas Sauerwald</span>
<span class="title">Cover Time and Broadcast Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1842">10.4230/LIPIcs.STACS.2009.1842</a>
</li>
<li>
<span class="authors">Matthias Englert, Heiko Röglin, Jacob Spönemann, and Berthold Vöcking</span>
<span class="title">Economical Caching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1826">10.4230/LIPIcs.STACS.2009.1826</a>
</li>
<li>
<span class="authors">Babak Farzad, Lap Chi Lau, Van Bang Le, and Nguyen Ngoc Tuy</span>
<span class="title">Computing Graph Roots Without Short Cycles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1827">10.4230/LIPIcs.STACS.2009.1827</a>
</li>
<li>
<span class="authors">Michael R. Fellows, Jiong Guo, Hannes Moser, and Rolf Niedermeier</span>
<span class="title">A Generalization of Nemhauser and Trotter's Local Optimization Theorem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1820">10.4230/LIPIcs.STACS.2009.1820</a>
</li>
<li>
<span class="authors">Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Daniel Raible, Saket Saurabh, and Yngve Villanger</span>
<span class="title">Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1843">10.4230/LIPIcs.STACS.2009.1843</a>
</li>
<li>
<span class="authors">Alain Finkel and Jean Goubault-Larrecq</span>
<span class="title">Forward Analysis for WSTS, Part I: Completions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1844">10.4230/LIPIcs.STACS.2009.1844</a>
</li>
<li>
<span class="authors">Fedor V. Fomin, Petr A. Golovach, and Dimitrios M. Thilikos</span>
<span class="title">Approximating Acyclicity Parameters of Sparse Hypergraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1803">10.4230/LIPIcs.STACS.2009.1803</a>
</li>
<li>
<span class="authors">Gianni Franceschini, Roberto Grossi, and S. Muthukrishnan</span>
<span class="title">Optimal Cache-Aware Suffix Selection</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1845">10.4230/LIPIcs.STACS.2009.1845</a>
</li>
<li>
<span class="authors">Peter Gacs, Mathieu Hoyrup, and Cristobal Rojas</span>
<span class="title">Randomness on Computable Probability Spaces - A Dynamical Point of View</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1828">10.4230/LIPIcs.STACS.2009.1828</a>
</li>
<li>
<span class="authors">Wouter Gelade, Marcel Marquardt, and Thomas Schwentick</span>
<span class="title">The Dynamic Complexity of Formal Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1829">10.4230/LIPIcs.STACS.2009.1829</a>
</li>
<li>
<span class="authors">Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, and Marc Thurley</span>
<span class="title">A Complexity Dichotomy for Partition Functions with Mixed Signs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1821">10.4230/LIPIcs.STACS.2009.1821</a>
</li>
<li>
<span class="authors">Andre Gronemeier</span>
<span class="title">Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information Complexity of the AND-Function and Disjointness</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1846">10.4230/LIPIcs.STACS.2009.1846</a>
</li>
<li>
<span class="authors">Roberto Grossi, Alessio Orlandi, Rajeev Raman, and S. Srinivasa Rao</span>
<span class="title">More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1847">10.4230/LIPIcs.STACS.2009.1847</a>
</li>
<li>
<span class="authors">Danny Hermelin, Gad M. Landau, Shir Landau, and Oren Weimann</span>
<span class="title">A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1804">10.4230/LIPIcs.STACS.2009.1804</a>
</li>
<li>
<span class="authors">Florian Horn</span>
<span class="title">Random Fruits on the Zielonka Tree</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1848">10.4230/LIPIcs.STACS.2009.1848</a>
</li>
<li>
<span class="authors">Juraj Hromkovic and Georg Schnitger</span>
<span class="title">Ambiguity and Communication</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1805">10.4230/LIPIcs.STACS.2009.1805</a>
</li>
<li>
<span class="authors">Szczepan Hummel, Henryk Michalewski, and Damian Niwinski</span>
<span class="title">On the Borel Inseparability of Game Tree Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1849">10.4230/LIPIcs.STACS.2009.1849</a>
</li>
<li>
<span class="authors">Artur Jez and Alexander Okhotin</span>
<span class="title">Equations over Sets of Natural Numbers with Addition Only</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1806">10.4230/LIPIcs.STACS.2009.1806</a>
</li>
<li>
<span class="authors">Daniel Kirsten and Sylvain Lombardy</span>
<span class="title">Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1850">10.4230/LIPIcs.STACS.2009.1850</a>
</li>
<li>
<span class="authors">Stefan Kratsch</span>
<span class="title">Polynomial Kernelizations for MIN F^+Pi_1 and MAX NP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1851">10.4230/LIPIcs.STACS.2009.1851</a>
</li>
<li>
<span class="authors">Fabian Kuhn</span>
<span class="title">Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1852">10.4230/LIPIcs.STACS.2009.1852</a>
</li>
<li>
<span class="authors">Francois Le Gall</span>
<span class="title">Efficient Isomorphism Testing for a Class of Group Extensions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1830">10.4230/LIPIcs.STACS.2009.1830</a>
</li>
<li>
<span class="authors">Bodo Manthey</span>
<span class="title">On Approximating Multi-Criteria TSP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1853">10.4230/LIPIcs.STACS.2009.1853</a>
</li>
<li>
<span class="authors">Daniel Marx</span>
<span class="title">Tractable Structures for Constraint Satisfaction with Truth Tables</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1807">10.4230/LIPIcs.STACS.2009.1807</a>
</li>
<li>
<span class="authors">Sven Schewe</span>
<span class="title">Büchi Complementation Made Tight</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1854">10.4230/LIPIcs.STACS.2009.1854</a>
</li>
<li>
<span class="authors">Lutz Schröder and Dirk Pattinson</span>
<span class="title">Strong Completeness of Coalgebraic Modal Logics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1855">10.4230/LIPIcs.STACS.2009.1855</a>
</li>
<li>
<span class="authors">Kenya Ueno</span>
<span class="title">A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1808">10.4230/LIPIcs.STACS.2009.1808</a>
</li>
<li>
<span class="authors">Marius Zimand</span>
<span class="title">Extracting the Kolmogorov Complexity of Strings and Sequences from Sources with Limited Independence</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.STACS.2009.1812">10.4230/LIPIcs.STACS.2009.1812</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