ISBN: 3-540-66408-4
TITLE: Mathematical Foundations of Computer Science 1999
AUTHOR: Kutylowski, Miroslaw; Pacholski, Leszek; Wierzbicki, Tomasz (Eds.)
TOC:

Computing over reals
On-Line Addition in Real Base 1
Christiane Frougny
Query languages for real number databases based on descriptive complexity over R 12
Klaus Meer
The Arithmetical Hierarchy of Real Numbers 23
Xizhong Zheng, Klaus Weihrauch
Compression techniques
Invited lecture: The Burrows-Wheeler Transform: Theory and Practice 34
Giovanni Manzini
Efficiency of Fast Parallel Pattern Searching in Highly Compressed Texts 48
Leszek Gasieniec, Alan Gibbons, Wojciech Rytter
Foundations of programming
Computing and Comparing Semantics of Programs in Four-valued Logics 59
Yann Loyer, Nicolas Spyratos, Daniel Stamate
Foundations of Modular SOS 70
Peter D. Mosses
Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces 81
Anca Muscholl, Doron Peled
Complexity and algorithms
On the Complexity of Recognizing the Hilbert Basis of a Linear Diophantine System 92
Arnaud Durand, Miki Hermann, Laurent Juban
The complexity of the extended GCD problem 103
George Havas, Jean-Pierre Seifert
Complexity Results for Confluence Problems 114
Markus Lohrey
Model checking
Is your Model Checker on Time? 125
Luca Aceto, Francois Laroussinie
Clausal Resolution for CTL* 137
Alexander Bolotov, Clare Dixon, Michael Fisher
Model Checking and Higher-Order Recursion 149
Hardi Hungar
Distributed computing
Multiparty Communication Complexity: Very Hard Functions 160
Jn Mnuch
Invited lecture: New Perspectives in Distributed Computing 170
Maurice Herlihy, Sergio Rajsbaum
Functional programming
An Improved Disjunctive Strictness Analysis for Lazy Functional Languages 187
Grzegorz Grudzinski
Unique Fixed Point Induction for McCarthy's Amb 198
Soren B. Lassen, Andrew Moran
Automata
On Some Topological Properties of Linear Cellular Automata 209
Luciano Margara
Real-time language recognition by one-way and two-way cellular automata 220
Katsuhiko Nakamura
Average state complexity of operations on unary automata 231
Cyril Nicaud
Fooling Rebound Automata 241
Holger Petersen
Algorithms and complexity
The Complexity of Minimizing FBDDs 251
Detlef Sieling
Efficient Strongly Universal and Optimally Universal Hashing 262
Philipp Woelfel
Lower and Upper Bounds for the Problem of Page Replication in Ring
Networks 273
Wlodzimierz  lazek
Security
Invited lecture: Language-Based Security 284
Dexter Kozen
Logic
An Algebraic Approach to Knowledge Representation 299
Janis Cerulis
On the structure of the monadic logic of the binary tree 310
D. Janin, G. Lenzi
A New Space Bound for the Modal Logics K4, KD4 and S4 321
Linh Anh Nguyen
Counting problems
On Approximating the Number of Bases of Exchange Preserving Matroids 332
Anna Gambin
Processes and Bisimulation
The Semantic Foundations of a Compositional Proof Method for Syn-
chronously Communicating Processes 343
F.S. de Boer, W.-P. de Roever, U. Hannemann
On Plain and Hereditary History-Preserving Bisimulation 354
Sibylle B. Fr. oschle, Thomas T. Hildebrandt
Approximating Weak Bisimulation on Basic Process Algebras 366
Jitka Stribrna
Graph algorithms
Edge Coloring of Bipartite Graphs with Constraints 376
Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano
An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover 387
Henning Fernau, Rolf Niedermeier
On Minimum Edge Ranking Spanning Trees 398
Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki
Complexity
Football Elimination is Hard to Decide Under the 3-Point-Rule 410
Thorsten Bernholt, Alexander Glich, Thomas Hofmeister, Niels Schmitt
Generalized Regular Counting Classes 419
Ulrich Hertrampf
A Foundation of Programming a Multi-Tape Quantum Turing Machine 430
Tomoyuki Yamakami
Types: theory and applications
Invited lecture: A Type Discipline for Solving Year 2000 Problems in
COBOL programs 442
Mads Tofte
Type Reconstruction for Functional Programs with Subtyping over a Lat-
tice of Atomic Types 443
Jerzy Tiuryn
Author Index 455
END
