LIPIcs, Volume 3, STACS 2009

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