STACS 2005

22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, February 24-26, 2005. Proceedings

  • Volker Diekert
  • Bruno Durand
Conference proceedings STACS 2005

DOI: 10.1007/b106485

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

Table of contents

  1. Front Matter
  2. Invited Talks

  3. Session 1A

  4. Session 1B

    1. Dietmar Berwanger, Giacomo Lenzi
      Pages 97-109
    2. Manuel Bodirsky
      Pages 110-120
  5. Session 2A

  6. Session 2B

    1. Tomáš Brázdil, Antonín Kučera, Oldřich Stražovský
      Pages 145-157
    2. Detlef Kähler, Ralf Küsters, Thomas Wilke
      Pages 158-169
  7. Session 3A

    1. Christian Glaßer
      Pages 170-181
    2. Frank Harary, Wolfgang Slany, Oleg Verbitsky
      Pages 182-193
  8. Session 3B

    1. Zdeněk Dvořák, Vít Jelínek, Daniel Král’, Jan Kynčl, Michael Saks
      Pages 206-217
    2. Xiang-Yang Li, Zheng Sun, Weizhao Wang
      Pages 218-230
    3. Petra Berenbrink, Tom Friedetzky, Zengjian Hu, Russell Martin
      Pages 231-243

About these proceedings

Keywords

Automat algorithmics algorithms automata automata theory combinatorial optimization complexity complexity theory computational geometry computer computer science formal language formal languages optimization

Editors and affiliations

  • Volker Diekert
    • 1
  • Bruno Durand
    • 2
  1. 1.Universität Stuttgart, FMIGermany
  2. 2.LIF, CNRS & Univ. de Provence,Marseille

Bibliographic information

  • Copyright Information Springer-Verlag Berlin Heidelberg 2005
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-24998-6
  • Online ISBN 978-3-540-31856-9
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349