Table of contents

  1. C. Wrathall, V. Diekert, F. Otto
    Pages 511-521
  2. Back Matter

About these proceedings


This volume contains 10 invited papers and 40 short communications contributed for presentation at the 17th Symposium on Mathematical Foundations of Computer Science, held in Prague, Czechoslovakia, August 24-28, 1992. The series of MFCS symposia, organized alternately in Poland and Czechoslovakia since 1972, has a long and well established tradition. The purpose of the series is to encourage high-quality research in all branches of theoretical computer science and to bring together specialists working actively in the area. Numerous topics are covered in this volume. The invited papers cover: range searching with semialgebraic sets, graph layout problems, parallel recognition and ranking of context-free languages, expansion of combinatorial polytopes, neural networks and complexity theory, theory of computation over stream algebras, methods in parallel algorithms, the complexity of small descriptions, weak parallel machines, and the complexity of graph connectivity.


Datenstrukturen Komplexität Nebenläufigkeit Parallelität Semantik Text algorithms complexity concurrency data structures logic parallelism semantics sets theoretical computer science

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 1992
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-55808-8
  • Online ISBN 978-3-540-47291-9
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
IT & Software