Table of contents

  1. Front Matter
  2. Rolf Hennicker, Martin Wirsing
    Pages 19-37
  3. Ming Li, Paul Vitányi
    Pages 38-50
  4. Antoni Mazurkiewicz
    Pages 51-66
  5. Daniel A. Spielman
    Pages 67-84
  6. Alfons Avermiddig, Manfred Kunde, Andre Osterloh
    Pages 93-104
  7. Eike Best, Thomas Thielke
    Pages 105-116
  8. Eric Badouel, Philippe Darondeau
    Pages 117-128
  9. Christian Choffrut, Leucio Guerra
    Pages 138-149
  10. Felipe Cucker, Klaus Meer
    Pages 157-167
  11. Frank Drewes, Hans-Jörg Kreowski, Denis Lapoire
    Pages 169-178
  12. Leszek Gąsieniec, Piotr Indyk
    Pages 188-197
  13. Damas P. Gruska
    Pages 198-209
  14. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
    Pages 222-232
  15. Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter
    Pages 245-256
  16. Manfred Kudlek, Solomon Marcus, Alexandru Mateescu
    Pages 269-280
  17. Salvatore La Torre, Margherita Napoli, Mimmo Parente
    Pages 293-304
  18. Christos Levcopoulos, Joachim Gudmundsson
    Pages 305-316
  19. Bruno Martin
    Pages 329-339
  20. Marios Mavronicolas, Nikos Papadakis
    Pages 340-351
  21. Rolf Niedermeier, Klaus Reinhardt, Peter Sanders
    Pages 364-375
  22. Elizaveta A. Okol'nishnikova
    Pages 376-387
  23. Friedrich Otto, Andrea Sattler-Klein
    Pages 388-399
  24. A. Rabinovich, B. A. Trakhtenbrot
    Pages 411-422
  25. Frank C. Stephan, Sebastiaan A. Terwijn
    Pages 441-451
  26. Irina Virbitskaite, Anzhelika Votintseva
    Pages 463-474
  27. Back Matter

About these proceedings


This book constitutes the refereed proceedings of the 11th International Symposium on Fundamentals of Computer Theory, FCT'97, held in Krakow, Poland, in September 1997.
The 34 revised full papers presented in the volume were selected from a total of 72 submissions. Also included are six invited papers by leading scientists. The papers address a variety of current topics in theoretical computer science including models of computation, concurrency, algorithms, complexity theory, programming theory, formal languages, graph theory and discrete mathematics, networking, automata theory, term rewriting, etc.


algorithms automata automata theory complexity complexity theory computer computer science formal language formal languages programming term rewriting theoretical computer science

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 1997
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-63386-0
  • Online ISBN 978-3-540-69529-5
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site