STACS 2002

19th Annual Symposium on Theoretical Aspects of Computer Science Antibes - Juan les Pins, France, March 14–16, 2002 Proceedings

  • Helmut Alt
  • Afonso Ferreira
Conference proceedings STACS 2002
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2285)

Table of contents

  1. Front Matter
    Pages I-XIV
  2. Invited Papers

    1. Yan Zong Ding, Michael O. Rabin
      Pages 1-26
    2. Gilles Dowek
      Pages 50-64
  3. Algorithms

    1. Pierre Fraigniaud, Cyril Gavoille
      Pages 65-75
    2. Amos Korman, David Peleg, Yoav Rodeh
      Pages 76-87
    3. E. Boros, V. Gurvich, L. Khachiyan, K. Makino
      Pages 133-141
    4. Khaled M. Elbassioni
      Pages 142-153
    5. Hannah Bast
      Pages 166-178
    6. Alain Darte, Guillaume Huard
      Pages 179-191
    7. Thomas Hofmeister, Uwe Schöning, Rainer Schuler, Osamu Watanabe
      Pages 192-202
    8. L. Sunil Chandran, L. Shankar Ram
      Pages 227-237
    9. Joachim Giesen, Matthias John
      Pages 238-249

About these proceedings

Keywords

Automat algorithms automata complexity computer computer science formal language formal languages logic

Editors and affiliations

  • Helmut Alt
    • 1
  • Afonso Ferreira
    • 2
  1. 1.Institute for Computer ScienceFree University of BerlinBerlinGermany
  2. 2.CNRS - I3S - INRIA Sophia AntipolisSophia AntipolisFrance

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-45841-7
  • Copyright Information Springer-Verlag Berlin Heidelberg 2002
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-43283-8
  • Online ISBN 978-3-540-45841-8
  • Series Print ISSN 0302-9743
  • About this book