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
  17. Robert Daley, Bala Kalyanasundaram
    Pages 218-226
  18. Carsten Damm, Markus Holzer, Klaus-Jörn Lange
    Pages 227-235
  19. D. Derencourt, J. Karhumäki, M. Latteux, A. Terlutte
    Pages 236-245
  20. Rainer Fdelmann, Peter Mysliwietz
    Pages 246-254
  21. Paul Gastin, Antoine Petit
    Pages 255-263
  22. Andreas Goerdt
    Pages 264-274
  23. Robert Gold
    Pages 275-283
  24. Irène Guessarian, Marcos Veloso-Peixoto
    Pages 284-297
  25. Torben Hagerup, Ola Petersson
    Pages 298-306
  26. Petr Jančar, František Mráz, Martin Plátek
    Pages 307-314
  27. Cosimo Laneve, Ugo Montanari
    Pages 336-345
  28. Klaus-Jörn Lange, Peter Rossmanith
    Pages 346-354
  29. Igor Litovsky, Yves Métivier, Eric Sopena
    Pages 364-373
  30. Osamu Maruyama, Satoru Miyano
    Pages 383-391
  31. David Murphy, Axel Poigné
    Pages 401-411
  32. Edward Ochmański
    Pages 412-420
  33. G. Michele Pinna, Axel Poigné
    Pages 430-441
  34. W. Preilowski, E. Dahlhaus, G. Wechsung
    Pages 442-450
  35. Teodor C. Przymusinski
    Pages 451-462
  36. Nicolas Reimen
    Pages 472-482
  37. Thomas Roos, Gerhard Albers
    Pages 483-493
  38. Andrew Szilard, Sheng Yu, Kaizhong Zhang, Jeffrey Shallit
    Pages 494-503

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
Finance, Business & Banking
IT & Software
Consumer Packaged Goods