Table of contents

  1. Front Matter
  2. Jean-Pierre Jouannaud
    Pages 15-25
  3. Dexter Kozen
    Pages 26-47
  4. Jan Krajíček, Pavel Pudlák, Jiří Sgall
    Pages 48-60
  5. Friedhelm Meyer auf der Heide
    Pages 76-87
  6. Alan L. Selman
    Pages 88-104
  7. Jerzy Tiuryn
    Pages 105-120
  8. Jacobo Torán
    Pages 121-134
  9. Eric Allender, Ulrich Hertrampf
    Pages 158-164
  10. Fabrizio d'Amore, Paolo Giulio Franciosa
    Pages 165-172
  11. Sanjoy K. Baruah, Rodney R. Howell, Louis E. Rosier
    Pages 173-179
  12. A. de Bruin, E. P. de VINK
    Pages 180-186
  13. Gerhard Buntrock, Lane A. Hemachandra, Dirk Siefkes
    Pages 187-194
  14. Marek Chrobak, Lawrence L. Larmore
    Pages 202-208
  15. M. Clerbout, D. Gonzalez
    Pages 209-216

About these proceedings


This volume contains papers selected for presentation at the 15th Symposium on Mathematical Foundations of Computer Science, MFCS '90, held at Banská Bystrica, Czechoslovakia, August 27-31, 1990. Previous MFCS proceedings have also been published in the Lecture Notes in Computer Science. This symposium is the 15th in a series of international meetings which have taken place in Czechoslovakia and Poland. The aim of these symposia is to bring together specialists in theoretical fields of computer science from various countries and to stimulate mathematical research in theoretical computer science. These proceedings consist of 10 invited papers and 52 communications selected by the international Program Committee. The papers present the latest results in key areas of computer science by authors from Europe, USA, Japan and China.


Algorithmen Algorithms Automata Theory Automatentheorie Computational Complexity Distributed Computing Graph Hashing Information Komplexität Resolution Verteiltes Rechnen complexity complexity theory sets

Bibliographic information