Table of contents

  1. Front Matter
  2. Micah Adler, John W. Byers, Richard M. Karp
    Pages 1-20
  3. Michele Flammini, Jan van Leeuwen, Alberto Marchetti-Spaccamela
    Pages 37-49
  4. Viliam Geffert
    Pages 50-65
  5. Georg Gottlob, Nicola Leone, Helmut Veith
    Pages 66-81
  6. Dominique Perrin
    Pages 94-104
  7. Paul Vitányi
    Pages 106-128
  8. Eric Allender, Martin Strauss
    Pages 129-138
  9. Carsten Damm, Markus Holzer
    Pages 149-158
  10. Steven Homer, Sarah Mocas
    Pages 159-168
  11. Susanne Kaufmann, Martin Kummer
    Pages 169-178
  12. Danièle Beauquier, Dima Burago, Anatol Slissenko
    Pages 191-200
  13. Thomas Hofmeister, Hanno Lefmann
    Pages 201-210
  14. Jyrki Katajainen, Tomi Pasanen, George Titan
    Pages 211-220

About these proceedings

Introduction

This book presents the proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science, MFCS'95, held in Prague, Czech Republic in August/September 1995.
The book contains eight invited papers and two abstracts of invited talks by outstanding scientists as well as 44 revised full research papers selected from a total of 104 submissions. All relevant aspects of theoretical computer science are addressed, particularly the mathematical foundations; the papers are organized in sections on structural complexity, algorithms, complexity theory, graphs in models of computation, lower bounds, formal languages, unification, rewriting and type theory, distributed computation, concurrency, semantics, model checking, and formal calculi.

Keywords

algorithm algorithms complexity complexity theory formal language model checking semantics

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-60246-1
  • Copyright Information Springer-Verlag 1995
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-60246-0
  • Online ISBN 978-3-540-44768-9
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book