Skip to main content
SpringerLink
Log in

Mathematical Foundations of Computer Science 1999

24th International Symposium, MFCS'99 Szklarska Poreba, Poland, September 6-10, 1999 Proceedings

  • Conference proceedings
  • © 1999

Overview

Editors:
  1. Mirosław Kutyłowski

    1. Institute of Computer Science, University of Wrocław, Wrocław, Poland

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Leszek Pacholski

    1. Institute of Computer Science, University of Wrocław, Wrocław, Poland

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Tomasz Wierzbicki

    1. Institute of Computer Science, University of Wrocław, Wrocław, Poland

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (41 papers)

  1. Front Matter

    Pages I-XII
    Download chapter PDF

  2. Computing Over Reals

    1. On-Line Addition in Real Base

      • Christiane Frougny
      Pages 1-11

    2. Query Languages for Real Number Databases Based on Descriptive Complexity over R

      • Klaus Meer
      Pages 12-22

    3. The Arithmetical Hierarchy of Real Numbers

      • Xizhong Zheng, Klaus Weihrauch
      Pages 23-33

  3. Compression Techniques

    1. The Burrows-Wheeler Transform: Theory and Practice

      • Giovanni Manzini
      Pages 34-47

    2. Efficiency of Fast Parallel Pattern Searching in Highly Compressed Texts

      • Leszek Gąsieniec, Alan Gibbons, Wojciech Rytter
      Pages 48-58

  4. Foundations of Programming

    1. Computing and Comparing Semantics of Programs in Four-Valued Logics

      • Yann Loyer, Nicolas Spyratos, Daniel Stamate
      Pages 59-69

    2. Foundations of Modular SOS

      • Peter D. Mosses
      Pages 70-80

    3. Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces

      • Anca Muscholl, Doron Peled
      Pages 81-91

  5. Complexity and Algorithms

    1. On the Complexity of Recognizing the Hilbert Basis of a Linear Diophantine System

      • Arnaud Durand, Miki Hermann, Laurent Juban
      Pages 92-102

    2. The Complexity of the Extended GCD Problem

      • George Havas, Jean-Pierre Seifert
      Pages 103-113

    3. Complexity Results for Confluence Problems

      • Markus Lohrey
      Pages 114-124

  6. Model Checking

    1. Is Your Model Checker on Time?

      • Luca Aceto, François Laroussinie
      Pages 125-136

    2. Clausal Resolution for CTL

      • Alexander Bolotov, Clare Dixon, Michael Fisher
      Pages 137-148

    3. Model Checking and Higher-Order Recursion

      • Hardi Hungar
      Pages 149-159

  7. Distributed Computing

    1. Multiparty Communication Complexity: Very Hard Functions

      • Ján Maňuch
      Pages 160-169

    2. New Perspectives in Distributed Computing

      • Maurice Herlihy, Sergio Rajsbaum
      Pages 170-186

  8. Functional Programming

    1. An Improved Disjunctive Strictness Analysis for Lazy Functional Languages

      • Grzegorz Grudziński
      Pages 187-197

    2. Unique Fixed Point Induction for McCarthy’s Amb

      • Søren B. Lassen, Andrew Moran
      Pages 198-208

  9. Automata

    1. On Some Topological Properties of Linear Cellular Automata

      • Luciano Margara
      Pages 209-219
Back to top

Keywords

About this book

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.

Editors and Affiliations

  • Institute of Computer Science, University of Wrocław, Wrocław, Poland

    Mirosław Kutyłowski, Leszek Pacholski, Tomasz Wierzbicki

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation