Table of contents

  1. Front Matter
  2. Gilles Brassard
    Pages 1-10
  3. Harry Buhrman, Luc Longpré
    Pages 11-24
  4. Martin Kummer
    Pages 25-36
  5. T. Harju, J. Karhumäki, D. Krob
    Pages 37-48
  6. Marie -Pierre Béal, Olivier Carton, Christophe Reutenauer
    Pages 49-59
  7. Klaus Ambos-Spies, Elvira Mayordomo, Yongge Wang, Xizhong Zheng
    Pages 61-74
  8. Harry Buhrman, Thomas Thierauf
    Pages 75-86
  9. V. Arvind, N. V. Vinodchandran
    Pages 99-110
  10. Frédérique Bassino
    Pages 125-135
  11. Karel Culik II, Jarkko Kari
    Pages 137-146
  12. Guy Melançon
    Pages 147-154
  13. Volker Heun, Ernst W. Mayr
    Pages 155-168
  14. Michel Morvan, Laurent Viennot
    Pages 169-180
  15. Petra Berenbrink, Friedhelm Meyer auf der Heide, Volker Stemann
    Pages 181-192
  16. Jānis Bārzdiņs, Rūsiņš Freivalds, Carl H. Smith
    Pages 205-218
  17. Erika Tateishi, Osamu Maruyama, Satoru Miyano
    Pages 219-230

About these proceedings


This book constitutes the refereed proceedings of the 13th Symposium on Theoretical Aspects of Computer Science, STACS 96, held in Grenoble, France in February 1996.
The 52 revised papers presented were selected from a total of 185 submissions; also included are three invited papers. The volume addresses all current aspects of theoretical computer science and is organized in sections on complexity theory, automata theory, parallel algorithms, learning, parallel and distributed systems, cryptography, logic and database theory, algorithms, semantics and program verification, and communication complexity.


Automat algorithm algorithms automata complexity complexity theory distributed systems logic semantics verification

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 1996
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-60922-3
  • Online ISBN 978-3-540-49723-3
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book