Table of contents

  1. Front Matter
  2. Pankaj K. Agarwal, Jiří Matoušek
    Pages 1-13
  3. J. Díaz
    Pages 14-23
  4. Klaus-Jörn Lange, Peter Rossmanith, Wojciech Rytter
    Pages 24-36
  5. Pekka Orponen
    Pages 50-61
  6. Uzi Vishkin
    Pages 81-81
  7. Avi Wigderson
    Pages 112-132
  8. Holger Bast, Martin Dietzfelbinger, Torben Hagerup
    Pages 133-141
  9. Bernd Becker, Joachim Hartmann
    Pages 142-152
  10. Hans-Jörg Burtschick, Albrecht Hoene
    Pages 153-161
  11. Jin-yi Cai, Lane A. Hemachandra, Jozef Vyskoč
    Pages 162-171
  12. Suresh Chari, Desh Ranjan, Pankaj Rohatgi
    Pages 172-180
  13. Christian Choffrut, Massimiliano Goldwurm
    Pages 181-190
  14. Hubert Comon, Maribel Fernández
    Pages 191-199
  15. J. F. Costa, A. Sernadas, C. Sernadas, H. -D. Ehrich
    Pages 200-208
  16. P. -L. Curien, T. Hardin, A. Ríos
    Pages 209-217

About these proceedings

Introduction

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.

Keywords

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

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-55808-X
  • Copyright Information Springer-Verlag 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
  • About this book
Industry Sectors
Electronics
Telecommunications
Biotechnology