Skip to main content
Book cover
  • Conference proceedings
  • © 2006

STACS 2006

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

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)

Conference series link(s): STACS: Annual Symposium on Theoretical Aspects of Computer Science

Conference proceedings info: STACS 2006.

Sections

eBook EUR 106.99
Price includes VAT (Finland)
  • ISBN: 978-3-540-32288-7
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book EUR 142.99
Price includes VAT (Finland)
Learn about institutional subscriptions

This is a preview of subscription content, access via your institution.

Table of contents (57 papers)

  1. Front Matter

    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

  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

  14. Quantum Algorithms for Matching and Network Flows

    • Andris Ambainis, Robert Špalek
    Pages 172-183

  16. Estimating Entropy and Entropy Norm on Data Streams

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

  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

Back to top

Keywords

  • Algorithms
  • Automat
  • algorithm
  • automata
  • complexity
  • complexity theory
  • computer
  • computer science
  • data structure
  • data structures
  • formal language
  • formal languages
  • logic
  • semantics
  • algorithm analysis and problem complexity
Back to top

Editors and Affiliations

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

    Bruno Durand

  • RWTH Aachen University,, Aachen,, Germany

    Wolfgang Thomas

Back to top

Bibliographic Information

Back to top
Access via your institution
eBook EUR 106.99
Price includes VAT (Finland)
  • ISBN: 978-3-540-32288-7
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book EUR 142.99
Price includes VAT (Finland)
Learn about institutional subscriptions