STACS 2007

24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007. Proceedings

  • Editors
  • Wolfgang Thomas
  • Pascal Weil
Conference proceedings STACS 2007

DOI: 10.1007/978-3-540-70918-3

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

Table of contents

  1. Front Matter
  2. Invited Talks

    1. Moshe Y. Vardi
      Pages 12-22
    2. Dorothea Wagner, Thomas Willhalm
      Pages 23-36
  3. Session 1A

    1. Bruno Courcelle, Andrew Twigg
      Pages 37-48
  4. Session 1B

    1. Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot
      Pages 73-84
    2. Francine Blanchet-Sadri, Joshua D. Gafni, Kevin H. Wilson
      Pages 97-108
  5. Session 2A

    1. Eldar Fischer, Orly Yahalom
      Pages 109-120
    2. Amin Coja-Oghlan, Michael Krivelevich, Dan Vilenchik
      Pages 121-132
  6. Session 2B

  7. Session 3A

    1. Ilan Newman, Yuri Rabinovich
      Pages 157-162
    2. Robert Elsässer, Thomas Sauerwald
      Pages 163-174
    3. Adrian Dumitrescu, Csaba D. Tóth
      Pages 175-187
  8. Session 3B

    1. Dietmar Berwanger
      Pages 188-199
    2. Felix Brandt, Felix Fischer, Markus Holzer
      Pages 212-223

About these proceedings

Keywords

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

Bibliographic information

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