Table of contents

  1. Front Matter
  2. Pavol Ďuriš, José D. P. Rolim
    Pages 38-51
  3. Stephen L. Bloom, Zoltán Ésik
    Pages 52-67
  4. Burkhard Monien, Ralf Diekmann, Reinhard Lüling
    Pages 72-86
  5. James Lipton, Michael J. O'Donnell
    Pages 87-111
  6. Fernando Orejas, Elvira Pino, Hartmut Ehrig
    Pages 112-126
  7. Mike Paterson, Vlado Dančík
    Pages 127-142
  8. Pavel A. Pevzner, Robert J. Lipshutz
    Pages 143-158
  9. Jiří Sgall
    Pages 159-176
  10. Glynn Winskel
    Pages 177-197
  11. F. Alessi, M. Dezani-Ciancaglini, U. de'Liguoro
    Pages 211-220
  12. Klaus Ambos-Spies, Hans-Christian Neis, Sebastiaan A. Terwijn
    Pages 221-232
  13. Ricardo A. Baeza-Yates
    Pages 233-244
  14. Alberto Bertoni, Carlo Mereghetti, Giovanni Pighizzini
    Pages 245-255
  15. A. Bouabdallah, M. C. Heydemann, J. Opatrny, D. Sotteau
    Pages 266-275

About these proceedings


This volume constitutes the proceedings of the 19th International Symposium on Mathematical Foundations of Theoretical Computer Science, MFCS '94, held in Kosice, Slovakia in August 1994.
MFCS '94 brought together specialists in theoretical fields of computer science from various countries in order to stimulate mathematical research in theoretical computer science. Besides 12 papers based on invited talks by renowned experts, the book contains 42 research contributions selected from a total of 112 submissions. All areas of theoretical computer science are presented, some from a particular mathematical point of view.


Algorithmen Algorithms Automaten Compiler Discrete Mathematics Diskrete Mathematik Komplexität Mathematical Logic Mathematische Logik Partition Permutation algorithm automata complexity logic

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag 1994
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-58338-7
  • Online ISBN 978-3-540-48663-3
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book