Table of contents

  1. Front Matter
  2. Giorgio Ausiello, Giuseppe F. Italiano, Umberto Nanni
    Pages 1-16
  3. Silvio Micali
    Pages 94-116
  4. Mogens Nielsen
    Pages 117-128
  5. Pavel Pudlák
    Pages 129-141
  6. Colin Stirling
    Pages 142-151
  7. Mikel Aldaz, Joos Heintz, Guillermo Matera, José L. Montaña, Luis M. Pardo
    Pages 167-175
  8. Michael Alekhnovich, Sam Buss, Shlomo Moran, Toniann Pitassi
    Pages 176-184
  9. Matthias Baaz, Agata Ciabattoni, Christian Fermüller, Helmut Veith
    Pages 203-212
  10. Richard Bonner, Rūsiņš Freivalds, Jānis Lapiņš, Antra Lukjanska
    Pages 213-219
  11. Flemming Nielson, Hanne Riis Nielson
    Pages 220-228
  12. Alexander Rabinovich
    Pages 229-238

About these proceedings


This book constitutes the refereed proceedings of the 23rd International Symposium on the Mathematical Foundations of Computer Science, MFCS'98, held in Brno, Czech Republic, in August 1998.
The 71 revised full papers presented were carefully reviewed and selected from a total of 168 submissions. Also included are 11 full invited surveys by prominent leaders in the area. The papers are organized in topical sections on problem complexity; logic, semantics, and automata; rewriting; automata and transducers; typing; concurrency, semantics, and logic; circuit complexity; programming; structural complexity; formal languages; graphs; Turing complexity and logic; binary decision diagrams, etc..


Algorithms Combinatorics Formal Languages Mathematical Logic calculus complexity logic sets

Bibliographic information

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