STACS 2000

17th Annual Symposium on Theoretical Aspects of Computer Science Lille, France, February 17–19, 2000 Proceedings

  • Horst Reichel
  • Sophie Tison
Conference proceedings STACS 2000
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1770)

Table of contents

  1. Front Matter
    Pages I-XIV
  2. M. Amin Shokrollahi
    Pages 1-12
  3. Thomas A. Henzinger, Rupak Majumdar
    Pages 13-34
  4. Kaustubh Deshmukh, Priti Shankar, Amitava Dasgupta, B. Sundar Rajan
    Pages 53-64
  5. Edward A. Hirsch
    Pages 65-73
  6. Jack H. Lutz, Martin J. Strauss
    Pages 74-86
  7. Eric Allender, Meena Mahajan
    Pages 87-98
  8. Gwénaël Richomme, Francis Wlazinski
    Pages 99-109
  9. Lucian Ilie, Wojciech Plandowski
    Pages 122-132
  10. Andris Ambainis, Ronald de Wolf
    Pages 133-144
  11. Sven Kosub, Klaus W. Wagner
    Pages 157-168
  12. Hesham Al-Ammal, Leslie Ann Goldberg, Phil MacKenzie
    Pages 169-180
  13. Nicolas Schabanel
    Pages 181-192
  14. Jessica H. Fong, Martin J. Strauss
    Pages 193-204
  15. Leonid Libkin
    Pages 217-229
  16. Edith Hemaspaandra
    Pages 230-241

About these proceedings

Keywords

Automat algorithms automata complexity computer computer science data structures formal language formal languages logic optimization verification

Editors and affiliations

  • Horst Reichel
    • 1
  • Sophie Tison
    • 2
  1. 1.Faculty of Computer Science, Dept. of Theoretical Computer ScienceUniversität DresdenDresdenGermany
  2. 2.Université de Lille, LIFL - UPRESA 8022, CNRS, Bât. M3 - UFR IEEAVilleneuve d’ASCQ CedexFrance

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-46541-3
  • Copyright Information Springer-Verlag Berlin Heidelberg 2000
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-67141-1
  • Online ISBN 978-3-540-46541-6
  • Series Print ISSN 0302-9743
  • About this book