STACS 2003

20th Annual Symposium on Theoretical Aspects of Computer Science Berlin, Germany, February 27 – March 1, 2003 Proceedings

  • Helmut Alt
  • Michel Habib
Conference proceedings STACS 2003

DOI: 10.1007/3-540-36494-3

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

Table of contents

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

  3. Contributed Papers

    1. Prosenjit Bose, 1Anil Maheshwari, Giri Narasimhan, Michiel Smid, Norbert Zeh
      Pages 38-49
    2. Stefan Langerman, William Steiger
      Pages 50-61
    3. Juhani Karhumäki, Michel Latteux, Ion Petre
      Pages 74-84
    4. Guillem Godoy, Ashish Tiwari, Rakesh Verma
      Pages 85-96
    5. Dariusz R. Kowalski, Andrzej Pelc
      Pages 109-120
    6. Andreas Jakoby, Maciej Liśkiewicz, Rüdiger Reischuk
      Pages 121-132
    7. Xizhong Zheng, Robert Rettinger, Burchard von Braunmühl
      Pages 167-178
    8. Lucian Ilie, Baozhen Shan, Sheng Yu
      Pages 179-190
    9. Veli Mäkinen, Gonzalo Navarro, Esko Ukkonen
      Pages 191-202

About these proceedings

Keywords

Automat algorithms automata complexity complexity theory computer computer science data structures formal language formal languages logic theoretical computer science

Editors and affiliations

  • Helmut Alt
    • 1
  • Michel Habib
    • 2
  1. 1.Institut für InformatikFreie Universität BerlinBerlinGermany
  2. 2.LIRMMMontpellier Cedex 5France

Bibliographic information

  • Copyright Information Springer-Verlag Berlin Heidelberg 2003
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-00623-7
  • Online ISBN 978-3-540-36494-8
  • Series Print ISSN 0302-9743