Advertisement

Table of contents

  1. Front Matter
  2. Christoph M. Hoffmann
    Pages 50-63
  3. Günter Hotz
    Pages 64-79
  4. Matthias Jantzen
    Pages 80-95
  5. Dominique Perrin
    Pages 134-148
  6. Franco P. Preparata
    Pages 149-161
  7. A. L. Semenov
    Pages 162-175
  8. José L. Balcázar, Ronald V. Book, Uwe Schöning
    Pages 185-193
  9. A. Černý
    Pages 232-239
  10. Gerardo Costa, Colin Stirling
    Pages 245-254
  11. Robert P. Daley, Carl H. Smith
    Pages 255-264
  12. Herbert Edelsbrunner, Emmerich Welzl
    Pages 265-272
  13. P. Enjalbert, M. Michel
    Pages 273-281
  14. Z. Habasiński
    Pages 282-290
  15. M. Hennessy, C. Stirling
    Pages 301-311
  16. Juraj Hromkovič
    Pages 322-329
  17. M. I. Kanovič
    Pages 348-354
  18. Klaus, Jörn Lange
    Pages 378-388
  19. Aldo de Luca, Antonio Restivo
    Pages 407-415
  20. Pekka Orponen, Uwe Schöning
    Pages 452-458
  21. Thomas Ottmann, Peter Widmayer
    Pages 459-470
  22. Jan Reiterman, Věra Trnková
    Pages 490-497

About these proceedings

Keywords

Monoid algorithms automata complexity complexity theory computability concurrency formal language linear optimization logic sets

Bibliographic information

  • DOI https://doi.org/10.1007/BFb0030285
  • Copyright Information Springer-Verlag Berlin Heidelberg 1984
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-13372-8
  • Online ISBN 978-3-540-38929-3
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site