Skip to main content
SpringerLink
Log in
Book cover

STACS 2006

23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings

  • Conference proceedings
  • © 2006

Overview

Editors:
  1. Bruno Durand

    1. LIF, CNRS & Univ. de Provence,, Marseille, France

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Wolfgang Thomas

    1. RWTH Aachen University,, Aachen,, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 3884)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: STACS 2006.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (57 papers)

  1. Front Matter

    Download chapter PDF

  2. The Ubiquitous Digital Tree

    • Philippe Flajolet
    Pages 1-22

  3. Flat Holonomies on Automata Networks

    • Gene Itkis, Leonid A. Levin
    Pages 23-49

  4. Interprocedurally Analyzing Polynomial Identities

    • Markus Müller-Olm, Michael Petter, Helmut Seidl
    Pages 50-67

  5. External String Sorting: Faster and Cache-Oblivious

    • Rolf Fagerberg, Anna Pagh, Rasmus Pagh
    Pages 68-79

  6. Amortized Rigidness in Dynamic Cartesian Trees

    • Iwona Bialynicka-Birula, Roberto Grossi
    Pages 80-91

  7. Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes

    • Ahmed Belal, Amr Elmasry
    Pages 92-103

  8. On Critical Exponents in Fixed Points of Binary k-Uniform Morphisms

    • Dalia Krieger
    Pages 104-114

  9. Equivalence of \(\mathbb{F}\)-Algebras and Cubic Forms

    • Manindra Agrawal, Nitin Saxena
    Pages 115-126

  10. Complete Codes in a Sofic Shift

    • Marie-Pierre Béal, Dominique Perrin
    Pages 127-136

  11. Kolmogorov Complexity with Error

    • Lance Fortnow, Troy Lee, Nikolai Vereshchagin
    Pages 137-148

  12. Kolmogorov Complexity and the Recursion Theorem

    • Bjørn Kjos-Hanssen, Wolfgang Merkle, Frank Stephan
    Pages 149-161

  13. Entanglement in Interactive Proof Systems with Binary Answers

    • Stephanie Wehner
    Pages 162-171

  14. Quantum Algorithms for Matching and Network Flows

    • Andris Ambainis, Robert Špalek
    Pages 172-183

  15. The Number of Runs in a String: Improved Analysis of the Linear Upper Bound

    • Wojciech Rytter
    Pages 184-195

  16. Estimating Entropy and Entropy Norm on Data Streams

    • Amit Chakrabarti, Khanh Do Ba, S. Muthukrishnan
    Pages 196-205

  17. Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems

    • Daniel Golovin, Vineet Goyal, R. Ravi
    Pages 206-217

  18. Exact Price of Anarchy for Polynomial Congestion Games

    • Sebastian Aland, Dominic Dumrauf, Martin Gairing, Burkhard Monien, Florian Schoppmann
    Pages 218-229

  19. Oblivious Symmetric Alternation

    • Venkatesan T. Chakaravarthy, Sambuddha Roy
    Pages 230-241

  20. Combining Multiple Heuristics

    • Tzur Sayag, Shai Fine, Yishay Mansour
    Pages 242-253
Back to top

Other volumes

  1. STACS 2006

Keywords

Editors and Affiliations

  • LIF, CNRS & Univ. de Provence,, Marseille, France

    Bruno Durand

  • RWTH Aachen University,, Aachen,, Germany

    Wolfgang Thomas

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation