Fundamentals of Computation Theory

13th International Symposium, FCT 2001 Riga, Latvia, August 22–24, 2001 Proceedings

  • Rūsiņš Freivalds

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

Table of contents

  1. Front Matter
    Pages I-XIII
  2. Invited Papers

    1. Jānis Bārzdiņš, Rūsiņš Freivalds, Carl H. Smith
      Pages 1-13
    2. Juhani Karhumäki
      Pages 15-23
    3. Boris Plotkin, Tanya Plotkin
      Pages 35-44
    4. Umesh Vazirani
      Pages 45-46
  3. Regular Papers

    1. Farid Ablayev, Aida Gainutdinova, Marek Karpinski
      Pages 59-70
    2. Aija Bērziņa, Richard Bonner
      Pages 83-93
    3. Fedor V. Fomin, Dieter Kratsch, Jean-Christophe Novelli
      Pages 118-125
    4. Kārlis Freivalds
      Pages 126-137
    5. Leszek Gasieniec, Igor Potapov
      Pages 138-149
    6. Bernhard Heinemann
      Pages 150-161
    7. Lane A. Hemaspaandra, Kari Pasanen, Jörg Rothe
      Pages 162-171

About these proceedings

Keywords

Approximation Algorithms Automata Complexity Theory Computational Structures Computing Theory Efficient Algorithms Foundations Network Algorithms Quantum Computing algorithmics algorithms computer computer science programming scheduling

Editors and affiliations

  • Rūsiņš Freivalds
    • 1
  1. 1.University of LatviaRigaLatvia

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-44669-9
  • Copyright Information Springer-Verlag Berlin Heidelberg 2001
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-42487-1
  • Online ISBN 978-3-540-44669-9
  • Series Print ISSN 0302-9743
  • About this book