Advertisement

Mathematical Foundations of Computer Science 2002

27th International Symposium, MFCS 2002 Warsaw, Poland, August 26–30, 2002 Proceedings

  • Krzysztof Diks
  • Wojciech Rytter
Conference proceedings MFCS 2002

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

Table of contents

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

  3. Contributed Talks

    1. Maria I. Andreou, Dimitris A. Fotakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis
      Pages 81-92
    2. Ola Angelsmark, Vilhelm Dahllöf, Peter Jonsson
      Pages 93-103
    3. Wolfgang W. Bein, Peter Brucker, Lawrence L. Larmore, James K. Park
      Pages 104-117
    4. Mihalis Beis, William Duckworth, Michele Zito
      Pages 118-130
    5. Endre Boros, Khaled Elbassioni, Vladimir Gurvich, Leonid Khachiyan
      Pages 143-154
    6. Didier Caucal, Teodor Knapik
      Pages 177-187
    7. Wun-Tat Chan, Tak-Wah Lam, Hing-Fung Ting, Prudence W. H. Wong
      Pages 188-200
    8. Robert Dabrowski, Wojtek Plandowski
      Pages 212-220
    9. Joost Engelfriet, Sebastian Maneth
      Pages 234-244
    10. Leah Epstein, Lene M. Favrholdt
      Pages 245-256
    11. Leah Epstein, Csanád Imreh, Rob van Stee
      Pages 257-268
    12. Aleksei V. Fishkin, Guochuan Zhang
      Pages 269-279
    13. Richard Groult, Martine Léonard, Laurent Mouchard
      Pages 292-304
    14. Lucian Iliea, Sheng Yu
      Pages 328-340
    15. Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Hideo Bannai, Setsuo Arikawa
      Pages 341-352
    16. Kazuo Iwama, Hiroki Morizumi
      Pages 353-364
    17. Chuzo Iwamoto, Takeshi Andou, Kenichi Morita, Katsunobu Imai
      Pages 365-374
    18. Jan Johannsen, N. S. Narayanaswamy
      Pages 387-398
    19. Iyad A. Kanj, Ljubomir Perković
      Pages 399-410
    20. Jan Kára, Daniel Král’
      Pages 411-422
    21. Sylvain Lombardy, Jacques Sakarovitch
      Pages 471-482
    22. Yann Loyer, Nicolas Spyratos
      Pages 483-494
    23. Thomas Lücking, Burkhard Monien, Manuel Rode
      Pages 495-505
    24. Patricia D. L. Machado, Donald Sannella
      Pages 506-518
    25. Dániel Marx
      Pages 532-542
    26. Benoît Masson, Ph. Schnoebelen
      Pages 543-555
    27. Catherine McCartin
      Pages 556-567
    28. Wolfgang Merkle, Nenad Mihailović
      Pages 568-580
    29. Till Mossakowski
      Pages 593-604

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science, MFCS 2002, held in Warsaw, Poland in August 2002.
The 48 revised full papers presented together with 5 invited papers were carefully reviewed and selected from 108 submissions. All relevant aspects of theoretical computer science are addressed, ranging from discrete mathematics, combinatorial optimization, graph theory, algorithms, and complexity to programming theory, formal methods, and mathematical logic.

Keywords

algorithms combinatorial optimization complexity computer computer science formal method logic mathematical logic optimization programming

Editors and affiliations

  • Krzysztof Diks
    • 1
  • Wojciech Rytter
    • 1
    • 2
  1. 1.Institute of InformaticsWarsaw UniversityWarszawaPoland
  2. 2.Department of Computer ScienceLiverpool UniversityLiverpoolUK

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-45687-2
  • Copyright Information Springer-Verlag Berlin Heidelberg 2002
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-44040-6
  • Online ISBN 978-3-540-45687-2
  • Series Print ISSN 0302-9743
  • Buy this book on publisher's site
Industry Sectors
Biotechnology
Electronics
IT & Software
Telecommunications