Table of Contents

• Preface - 26th International Symposium on Theoretical Aspects of Computer ScienceSusanne Albers, Jean-Yves Marion. [doi]
• A Comparison of Techniques for Sampling Web PagesEda Baykan, Monika Rauch Henzinger, Stefan F. Keller, Sebastian De Castelberg, Markus Kinzler. 13-30 [doi]
• Profinite Methods in Automata TheoryJean-Eric Pin. 31-50 [doi]
• Lower Bounds for Multi-Pass Processing of Multiple Data StreamsNicole Schweikardt. 51-61 [doi]
• Shortest Paths Avoiding Forbidden SubpathsMustaq Ahmed, Anna Lubiw. 63-74 [doi]
• Generating Shorter Bases for Hard Random LatticesJoël Alwen, Chris Peikert. 75-86 [doi]
• Quantum Query Complexity of Multilinear Identity TestingVikraman Arvind, Partha Mukhopadhyay. 87-98 [doi]
• An Order on Sets of Tilings Corresponding to an Order on LanguagesNathalie Aubrun, Mathieu Sablik. 99-110 [doi]
• Compressed Representations of Permutations, and ApplicationsJérémy Barbay, Gonzalo Navarro. 111-122 [doi]
• On the Average Complexity of Moore s State Minimization AlgorithmFrédérique Bassino, Julien David, Cyril Nicaud. 123-134 [doi]
• Testing Linear-Invariant Non-Linear PropertiesArnab Bhattacharyya, Victor Chen, Madhu Sudan, Ning Xie. 135-146 [doi]
• Kolmogorov Complexity and Solovay FunctionsLaurent Bienvenu, Rod Downey. 147-158 [doi]
• Weak MSO with the Unbounding QuantifierMikolaj Bojanczyk. 159-170 [doi]
• Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus GraphsGlencora Borradaile, Erik D. Demaine, Siamak Tazari. 171-182 [doi]
• A Polynomial Kernel for Multicut in TreesNicolas Bousquet, Jean Daligault, Stéphan Thomassé, Anders Yeo. 183-194 [doi]
• On Local Symmetries and Universality in Cellular AutomataLaurent Boyer, Guillaume Theyssier. 195-206 [doi]
• Qualitative Reachability in Stochastic BPA GamesTomás Brázdil, Václav Brozek, Antonín Kucera, Jan Obdrzálek. 207-218 [doi]
• Locally Decodable Quantum CodesJop Briet, Ronald de Wolf. 219-230 [doi]
• Enumerating HomomorphismsAndrei A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx. 231-242 [doi]
• Hardness and Algorithms for Rainbow ConnectivitySourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster. 243-254 [doi]
• Nonclairvoyant Speed Scaling for Flow and EnergyHo-Leung Chan, Jeff Edmonds, Tak Wah Lam, Lap-Kei Lee, Alberto Marchetti-Spaccamela, Kirk Pruhs. 255-264 [doi]
• An Approximation Algorithm for l::infinity:: Fitting Robinson Structures to DistancesVictor Chepoi, Morgan Seston. 265-276 [doi]
• Almost-Uniform Sampling of Points on High-Dimensional Algebraic VarietiesMahdi Cheraghchi, Amin Shokrollahi. 277-288 [doi]
• Reverse Engineering Prefix TablesJulien Clément, Maxime Crochemore, Giuseppina Rindone. 289-300 [doi]
• The Price of Anarchy in Cooperative Network Creation GamesErik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam. 301-312 [doi]
• Error-Correcting Data StructuresRonald de Wolf. 313-324 [doi]
• Fragments of First-Order Logic over Infinite WordsVolker Diekert, Manfred Kufleitner. 325-336 [doi]
• Undecidable Properties of Limit Set Dynamics of Cellular AutomataPietro di Lena, Luciano Margara. 337-347 [doi]
• Semi-Online Preemptive Scheduling: One Algorithm for All VariantsTomás Ebenlendr, Jiri Sgall. 349-360 [doi]
• Improved Approximations for Guarding 1.5-Dimensional TerrainsKhaled M. Elbassioni, Erik Krohn, Domagoj Matijevic, Julián Mestre, Domagoj Severdija. 361-371 [doi]
• Cover Time and Broadcast TimeRobert Elsässer, Thomas Sauerwald. 373-384 [doi]
• Economical CachingMatthias Englert, Heiko Röglin, Jacob Spönemann, Berthold Vöcking. 385-396 [doi]
• Computing Graph Roots Without Short CyclesBabak Farzad, Lap Chi Lau, Van Bang Le, Nguyen Ngoc Tuy. 397-408 [doi]
• A Generalization of Nemhauser and Trotter s Local Optimization TheoremMichael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier. 409-420 [doi]
• Kernel(s) for Problems with No Kernel: On Out-Trees with Many LeavesHenning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Daniel Raible, Saket Saurabh, Yngve Villanger. 421-432 [doi]
• Forward Analysis for WSTS, Part I: CompletionsAlain Finkel, Jean Goubault-Larrecq. 433-444 [doi]
• Approximating Acyclicity Parameters of Sparse HypergraphsFedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos. 445-456 [doi]
• Optimal Cache-Aware Suffix SelectionGianni Franceschini, Roberto Grossi, S. Muthukrishnan. 457-468 [doi]
• Randomness on Computable Probability Spaces - A Dynamical Point of ViewPéter Gács, Mathieu Hoyrup, Cristobal Rojas. 469-480 [doi]
• The Dynamic Complexity of Formal LanguagesWouter Gelade, Marcel Marquardt, Thomas Schwentick. 481-492 [doi]
• A Complexity Dichotomy for Partition Functions with Mixed SignsLeslie Ann Goldberg, Martin Grohe, Mark Jerrum, Marc Thurley. 493-504 [doi]
• Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information Complexity of the AND-Function and DisjointnessAndre Gronemeier. 505-516 [doi]
• More Haste, Less Waste: Lowering the Redundancy in Fully Indexable DictionariesRoberto Grossi, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao. 517-528 [doi]
• A Unified Algorithm for Accelerating Edit-Distance Computation via Text-CompressionDanny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann. 529-540 [doi]
• Random Fruits on the Zielonka TreeFlorian Horn. 541-552 [doi]
• Ambiguity and CommunicationJuraj Hromkovic, Georg Schnitger. 553-564 [doi]
• On the Borel Inseparability of Game Tree LanguagesSzczepan Hummel, Henryk Michalewski, Damian Niwinski. 565-575 [doi]
• Equations over Sets of Natural Numbers with Addition OnlyArtur Jez, Alexander Okhotin. 577-588 [doi]
• Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus AutomataDaniel Kirsten, Sylvain Lombardy. 589-600 [doi]
• Polynomial Kernelizations for MIN F:::+:::Pi::1:: and MAX NPStefan Kratsch. 601-612 [doi]
• Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant TimeFabian Kuhn. 613-624 [doi]
• Efficient Isomorphism Testing for a Class of Group ExtensionsFrancois Le Gall. 625-636 [doi]
• On Approximating Multi-Criteria TSPBodo Manthey. 637-648 [doi]
• Tractable Structures for Constraint Satisfaction with Truth TablesDániel Marx. 649-660 [doi]
• Büchi Complementation Made TightSven Schewe. 661-672 [doi]
• Strong Completeness of Coalgebraic Modal LogicsLutz Schröder, Dirk Pattinson. 673-684 [doi]
• A Stronger LP Bound for Formula Size Lower Bounds via Clique ConstraintsKenya Ueno. 685-696 [doi]
• Extracting the Kolmogorov Complexity of Strings and Sequences from Sources with Limited IndependenceMarius Zimand. 697-708 [doi]