Advertisement

Table of contents

  1. Front Matter
  2. Ludmila A. Cherkasova
    Pages 27-43
  3. Maxime Crochemore
    Pages 44-58
  4. Uwe Schöning
    Pages 93-106
  5. Martin Wirsing, Rolf Hennicker, Ruth Breu
    Pages 121-137
  6. Burkhard Monien, Hal Sudborough
    Pages 138-153
  7. E. Allevi, A. Cherubini, S. Crespi Reghizzi
    Pages 162-170
  8. Frank Bauernöppel, Hermann Jung
    Pages 171-179
  9. J. Beauquier, A. Petit
    Pages 180-189
  10. Francis Bossut, Max Dauchet, Bruno Warin
    Pages 190-200
  11. Véronique Bruyere
    Pages 201-209
  12. Heino Carstensen
    Pages 210-219
  13. Bogdan S. Chlebus, Krzysztof Diks, Tomasz Radzik
    Pages 220-230
  14. B. S. Chlebus, K. Diks, T. Hagerup, T. Radzik
    Pages 231-239
  15. A. D'Atri, M. Moscarini, A. Sassano
    Pages 249-261
  16. Volker Diekert, Walter Vogler
    Pages 271-279
  17. Krzystof Diks, Hristo N. Djidjev, Ondrej Sykora, Imrich Vrto
    Pages 280-290
  18. Ricard Gavaldà, José L. Balcázar
    Pages 300-308
  19. Rodney R. Howell, Louis E. Rosier, Hsu-Chun Yen
    Pages 351-359
  20. Stéphane Kaplan
    Pages 381-395
  21. Jan Kratochvíl, Mirko Křivánek
    Pages 396-404
  22. Matthias Krause, Christoph Meinel, Stephan Waack
    Pages 405-413
  23. Kim G. Larsen, Bent Thomsen
    Pages 414-423
  24. D. Laurent, N. Spyratos
    Pages 424-432
  25. Philippe Le Chenadec
    Pages 433-444
  26. Krzysztof Loryś, Maciej Liśkiewicz
    Pages 445-453
  27. Marek Piotrow
    Pages 472-482
  28. Peter Ružička
    Pages 492-500
  29. Peter Ružička, Igor Prívara
    Pages 501-511

About these proceedings

Introduction

This volume contains 11 invited lectures and 42 communications presented at the 13th Conference on Mathematical Foundations of Computer Science, MFCS '88, held at Carlsbad, Czechoslovakia, August 29 - September 2, 1988. Most of the papers present material from the following four fields: - complexity theory, in particular structural complexity, - concurrency and parellelism, - formal language theory, - semantics. Other areas treated in the proceedings include functional programming, inductive syntactical synthesis, unification algorithms, relational databases and incremental attribute evaluation.

Keywords

algorithm algorithms complexity complexity theory computer computer science database formal language programming semantics

Bibliographic information

  • DOI https://doi.org/10.1007/BFb0017126
  • Copyright Information Springer-Verlag Berlin Heidelberg 1988
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-50110-7
  • Online ISBN 978-3-540-45926-2
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
Biotechnology
Electronics
IT & Software
Telecommunications