Table of contents

  1. Front Matter
  2. Jean-Pierre Jouannaud
    Pages 16-25
  3. Jeffrey Scott Vitter
    Pages 26-41
  4. Peter Roth
    Pages 42-49
  5. Christiane Frougny, Jacques Sakarovitch
    Pages 50-63
  6. Martin Schmidt
    Pages 64-75
  7. G. Guaiana, A. Restivo, S. Salemi
    Pages 76-88
  8. Volker Diekert
    Pages 105-117
  9. Maria Serna, Paul Spirakis
    Pages 118-126
  10. K. Madlener, F. Otto
    Pages 160-171
  11. Peter Rossmanith
    Pages 172-183
  12. Françoise Baude, Guy Vidal-Naquet
    Pages 184-195
  13. Luc Albert, Rafael Casas, François Fages, A. Torrecillas, Paul Zimmermann
    Pages 196-213
  14. Bal Wang, R. K. Shyamasundar
    Pages 214-227
  15. Miklos Santha, Christopher Wilson
    Pages 228-237

About these proceedings

Keywords

Algorithms Algorithmus Computational Geometry Concurrency Geometrische Algorithmen Random Access Memory Theoretical Computer Science Theoretische Informatik Verteilte Verarbeitung algorithm complexity computer science logic semantics verification

Bibliographic information

  • DOI https://doi.org/10.1007/BFb0020782
  • Copyright Information Springer-Verlag 1991
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-53709-0
  • Online ISBN 978-3-540-47002-1
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349