Mathematical Foundations of Computer Science 1999

24th International Symposium, MFCS’99 Szklarska Poręba, Poland, September 6–10,1999 Proceedings

  • Mirosław Kutyłowski
  • Leszek Pacholski
  • Tomasz Wierzbicki
Conference proceedings MFCS 1999

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

Table of contents

  1. Front Matter
    Pages I-XII
  2. Computing Over Reals

  3. Compression Techniques

    1. Leszek Gąsieniec, Alan Gibbons, Wojciech Rytter
      Pages 48-58
  4. Foundations of Programming

    1. Yann Loyer, Nicolas Spyratos, Daniel Stamate
      Pages 59-69
    2. Peter D. Mosses
      Pages 70-80
  5. Complexity and Algorithms

    1. Arnaud Durand, Miki Hermann, Laurent Juban
      Pages 92-102
    2. George Havas, Jean-Pierre Seifert
      Pages 103-113
    3. Markus Lohrey
      Pages 114-124
  6. Model Checking

    1. Luca Aceto, François Laroussinie
      Pages 125-136
    2. Alexander Bolotov, Clare Dixon, Michael Fisher
      Pages 137-148
    3. Hardi Hungar
      Pages 149-159
  7. Distributed Computing

    1. Maurice Herlihy, Sergio Rajsbaum
      Pages 170-186
  8. Functional Programming

    1. Søren B. Lassen, Andrew Moran
      Pages 198-208
  9. Automata

About these proceedings

Introduction

This volume contains papers selected for presentation during the 24th Interna­ tional Symposium on Mathematical Foundations of Computer Science held on September 6-10, 1999 in Szklarska Por^ba, Poland. The symposium, organized alternately in the Czech Republic, Slovakia, and Poland, focuses on theoretical aspects and mathematical foundations of computer science. The scientific program of the symposium consists of five invited talks given by Martin Dyer, Dexter Kozen, Giovanni Manzini, Sergio Rajsbaum, and Mads Tofte, and 37 accepted papers chosen out of 68 submissions. The volume contains all accepted contributed papers, and three invited papers. The contributed papers have been selected for presentation based on their scientific quality, novelty, and interest for the general audience of MFCS par­ ticipants. Each paper has been reviewed by at least three independent referees — PC members and/or sub-referees appointed by them. The papers were se­ lected for presentation during a fully electronic virtual meeting of the program committee on May 7, 1999. The virtual PC meeting was supported by software written by Artur Zgoda, Ph.D. student at the University of Wroclaw. The entire communication and access to quite a sensitive database at PC headquarters in Wroclaw was secured by cryptographic protocols based on technology of certificates.

Keywords

Automat Bisimulation algorithms automata complexity computer computer science distributed computing logic model checking programming

Editors and affiliations

  • Mirosław Kutyłowski
    • 1
  • Leszek Pacholski
    • 1
  • Tomasz Wierzbicki
    • 1
  1. 1.Institute of Computer ScienceUniversity of WrocławWrocławPoland

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-48340-3
  • Copyright Information Springer-Verlag Berlin Heidelberg 1999
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-66408-6
  • Online ISBN 978-3-540-48340-3
  • Series Print ISSN 0302-9743
  • About this book
Industry Sectors
Electronics
Telecommunications
Biotechnology