Mathematical Foundations of Computer Science 2001

26th International Symposium, MFCS 2001 Mariánské Lázne, Czech Republic, August 27–31, 2001 Proceedings

  • Jiří Sgall
  • Aleš Pultr
  • Petr Kolman
Conference proceedings MFCS 2001

DOI: 10.1007/3-540-44683-4

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2136)

Table of contents

  1. Front Matter
    Pages I-XII
  2. Invited Talks

  3. Contributed Talks

    1. Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Fran Rosamond et al.
      Pages 111-123
    2. Kazuyuki Amano, Tsukuru Hirosawa, Yusuke Watanabe, Akira Maruoka
      Pages 123-134
    3. Andris Ambainis, Arnolds Ķikusts
      Pages 135-147
    4. Chris Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard E. Stearns
      Pages 159-172
    5. Martin Beaudry, Markus Holzer
      Pages 173-185
    6. Ahmed Bouajjani, Peter Habermehl, Richard Mayr
      Pages 198-211
    7. Henrik Brosenne, Matthias Homeister, Stephan Waack
      Pages 212-223

About these proceedings

Keywords

algorithms complexity complexity theory computer computer science logic mathematical logic programming

Editors and affiliations

  • Jiří Sgall
    • 1
  • Aleš Pultr
    • 2
  • Petr Kolman
    • 2
  1. 1.Mathematical Institute, AS CRPraha 1Czech Republic
  2. 2.Faculty of Mathematics and Physics Institute for Theoretical Computer Science (ITI)Charles UniversityPraha 1Czech Republic

Bibliographic information

  • Copyright Information Springer-Verlag Berlin Heidelberg 2001
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-42496-3
  • Online ISBN 978-3-540-44683-5
  • Series Print ISSN 0302-9743