24. MFCS 1999: Szklarska Poreba, Poland

Computing Over Reals

• Christiane Frougny:
  On-Line Addition in Real Base. 1-11
  
• Klaus Meer:
  Query Languages for Real Number Databases Based on Descriptive Complexity over R. 12-22
  
• Xizhong Zheng, Klaus Weihrauch:
  The Arithmetical Hierarchy of Real Numbers. 23-33
  

Compression Techniques

• Giovanni Manzini:
  Invited Lecture: The Burrows-Wheeler Transform: Theory and Practice. 34-47
  
• Leszek Gasieniec, Alan Gibbons, Wojciech Rytter:
  Efficiency of Fast Parallel Pattern Searching in Highly Compressed Texts. 48-58
  

Foundations of Programming

• Yann Loyer, Nicolas Spyratos, Daniel Stamate:
  Computing and Comparing Semantics of Programs in Four-Valued Logics. 59-69
  
• Peter D. Mosses:
  Foundations of Modular SOS. 70-80
  
• Anca Muscholl, Doron Peled:
  Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces. 81-91
  

Complexity and Algorithms

• Arnaud Durand, Miki Hermann, Laurent Juban:
  On the Complexity of Recognizing the Hilbert Basis of a Linear Diophantine System. 92-102
  
• George Havas, Jean-Pierre Seifert:
  The Complexity of the Extended GCD Problem. 103-113
  
• Markus Lohrey:
  Complexity Results for Confluence Problems. 114-124
  

Model Checking

• Luca Aceto, François Laroussinie:
  Is Your Model Checker on Time? On the Complexity of Model Checking for Timed Modal Logics. 125-136
  
• Alexander Bolotov, Clare Dixon, Michael Fisher:
  Clausal Resolution for CTL^*. 137-148
  
• Hardi Hungar:
  Model Checking and Higher-Order Recursion. 149-159
  

Distributed Computing

• Ján Manuch:
  Multiparty Communication Complexity: Very Hard Functions. 160-169
  
• Maurice Herlihy, Sergio Rajsbaum:
  New Perspectives in Distributed Computing. 170-186
  

Functional Programming

• Grzegorz Grudzinski:
  An Improved Disjunctive Strictness Analysis for Lazy Functional Languages. 187-197
  
• Søren B. Lassen, Andrew Moran:
  Unique Fixed Point Induction for McCarthy's Amb. 198-208
  

Automata

• Luciano Margara:
  On Some Topological Properties of Linear Cellular Automata. 209-219
  
• Katsuhiko Nakamura:
  Real-Time Language Recognition by One-Way and Two-Way Cellular Automata. 220-230
  
• Cyril Nicaud:
  Average State Complexity of Operations on Unary Automata. 231-240
  
• Holger Petersen:
  Fooling Rebound Automata. 241-250
  

Algorithms and Complexity

• Detlef Sieling:
  The Complexity of Minimizing FBDDs. 251-261
  
• Philipp Woelfel:
  Efficient Strongly Universal and Optimally Universal Hashing. 262-272
  
• Wlodzimierz Glazek:
  Lower and Upper Bounds for the Problem of Page Replication in Ring Networks. 273-283
  

Security

• Dexter Kozen:
  Language-Based Security. 284-298
  

Logic

• Janis Cirulis:
  An Algebraic Approach to Knowledge Representation. 299-309
  
• David Janin, Giacomo Lenzi:
  On the Structure of the Monadic Logic of the Binary Tree. 310-320
  
• Linh Anh Nguyen:
  A New Space Bound for the Modal Logics K4, KD4 and S4. 321-331
  

Counting Problems

• Anna Gambin:
  On Approximating the Number of Bases of Exchange Preserving Matroids. 332-342
  

Processes and Bisimulation

• Frank S. de Boer, Willem P. de Roever, Ulrich Hannemann:
  The Semantic Foundations of a Compositional Proof Method for Synchronously Communicating Processes. 343-353
  
• Sibylle B. Fröschle, Thomas T. Hildebrandt:
  On Plain and Hereditary History-Preserving Bisimulation. 354-365
  
• Jitka Stríbrná:
  Approximating Weak Bisimulation on Basic Process Algebras. 366-375
  

Graph Algorithms

• Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano:
  Edge Coloring of Bipartite Graphs with Constraints. 376-386
  
• Henning Fernau, Rolf Niedermeier:
  An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover. 387-397
  
• Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki:
  On Minimum Edge Ranking Spanning Trees. 398-409
  

Complexity

• Thorsten Bernholt, Alexander Gülich, Thomas Hofmeister, Niels Schmitt:
  Football Elimination Is Hard to Decide Under the 3-Point-Rule. 410-418
  
• Ulrich Hertrampf:
  Generalized Regular Counting Classes. 419-429
  
• Tomoyuki Yamakami:
  A Foundation of Programming a Multi-tape Quantum Turing Machine. 430-441
  

Types: Theory and Applications

• Mads Tofte:
  A Type Discipline for Solving Year 2000 Problems in COBOL Programs. 442
  
• Jerzy Tiuryn:
  Type Reconstruction for Functional Programs with Subtyping over a Lattice of Atomic Types. 443-453