STACS 2006

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

  • Bruno Durand
  • Wolfgang Thomas
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3884)

Table of contents

  1. Front Matter
  2. Philippe Flajolet
    Pages 1-22
  3. Gene Itkis, Leonid A. Levin
    Pages 23-49
  4. Markus Müller-Olm, Michael Petter, Helmut Seidl
    Pages 50-67
  5. Rolf Fagerberg, Anna Pagh, Rasmus Pagh
    Pages 68-79
  6. Iwona Bialynicka-Birula, Roberto Grossi
    Pages 80-91
  7. Manindra Agrawal, Nitin Saxena
    Pages 115-126
  8. Marie-Pierre Béal, Dominique Perrin
    Pages 127-136
  9. Lance Fortnow, Troy Lee, Nikolai Vereshchagin
    Pages 137-148
  10. Bjørn Kjos-Hanssen, Wolfgang Merkle, Frank Stephan
    Pages 149-161
  11. Andris Ambainis, Robert Špalek
    Pages 172-183
  12. Amit Chakrabarti, Khanh Do Ba, S. Muthukrishnan
    Pages 196-205
  13. Sebastian Aland, Dominic Dumrauf, Martin Gairing, Burkhard Monien, Florian Schoppmann
    Pages 218-229
  14. Venkatesan T. Chakaravarthy, Sambuddha Roy
    Pages 230-241
  15. Tzur Sayag, Shai Fine, Yishay Mansour
    Pages 242-253

About these proceedings

Keywords

Algorithms Automat algorithm automata complexity complexity theory computer computer science data structure data structures formal language formal languages logic semantics

Editors and affiliations

  • Bruno Durand
    • 1
  • Wolfgang Thomas
    • 2
  1. 1.LIF, CNRS & Univ. de Provence,MarseilleFrance
  2. 2.RWTH Aachen University,Aachen,Germany

Bibliographic information

  • DOI https://doi.org/10.1007/11672142
  • Copyright Information Springer-Verlag Berlin Heidelberg 2006
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-32301-3
  • Online ISBN 978-3-540-32288-7
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book