Table of contents

  1. Front Matter
  2. Samson Abramsky
    Pages 1-4
  3. László Babai
    Pages 5-18
  4. Hans L. Bodlaender
    Pages 19-36
  5. Nachum Dershowitz
    Pages 37-43
  6. GianLuigi Ferrari, Ugo Montanari
    Pages 52-70
  7. Juraj Hromkovič, Georg Schnitger
    Pages 71-84
  8. Foto Afrati, Irène Guessarian, Michel de Rougemont
    Pages 117-128
  9. Luca Bernardinello, Lucia Pomello
    Pages 139-148
  10. Béatrice Bérard, Claudine Picaronny
    Pages 149-158
  11. Marcello M. Bonsangue, Joost N. Kok
    Pages 169-178
  12. G. Cattaneo, E. Formenti, L. Margara, J. Mazoyer
    Pages 179-188

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science, MFCS '97, held in Bratislava, Slovakia, in August 1997.
The 40 revised full papers presented were carefully selected from a total of 94 submissions. Also included are nine invited papers and two abstracts of invited talks. The papers cover the whole range of theoretical computer science including programming theory, complexity theory, mathematical logic, rewriting, grammars, formal languages, theory of algorithms, computational graph theory, etc.

Keywords

algorithms complexity complexity theory computer computer science formal language formal languages logic mathematical logic programming

Bibliographic information

  • DOI https://doi.org/10.1007/BFb0029943
  • Copyright Information Springer-Verlag 1997
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-63437-9
  • Online ISBN 978-3-540-69547-9
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book
Industry Sectors
Electronics
Telecommunications
Biotechnology