From tch@tcs.uni.wroc.pl Tue May 11 17:02:56 1999 Date: Tue, 11 May 1999 15:42:39 PDT From: Tomasz Charatonik Reply-To: Theory-A - TheoryNet World-Wide Events , Tomasz Charatonik To: THEORYNT@LISTSERV.NODAK.EDU Subject: MFCS'99 - accepted papers [ Please propagate the information. We apologize for multiple copies ] ************************************************************************ The 24th International Symposium on Mathematical Foundations of Computer Science September 6-10, 1999, Szklarska Poreba, Poland (see http://www.tcs.uni.wroc.pl/mfcs99/) LIST OF ACCEPTED PAPERS ************************************************************************ Luca Aceto, Francois Laroussinie Is your Model Checker on Time? (On the Complexity of Model Checking for Timed Modal Logics) Thorsten Bernholt, Alexander Guelich, Thomas Hofmeister, Niels Schmitt Football Elimination is hard to decide under the 3-point-rule Alexander Bolotov, Clare Dixon, Michael Fisher Clausal Resolution for CTL* Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano Edge Coloring of Bipartite Graphs with Constraints Janis Cirulis An Algebraic Approach to Knowledge Representation Frank de Boer, Willem-Paul de Roever, Ulrich Hannemann The Semantic Foundation of a Compositional Proof Method for Synchronously Communicating Processes Arnaud Durand, Miki Hermann, Laurent Juban On the Complexity of Recognizing the Hilbert Basis of a Linear Diophantine System Henning Fernau, Rolf Niedermeier An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover Christiane Frougny On-line addition in real base Sibylle B. Froeschle, Thomas T. Hildebrandt On Plain and Hereditary History-Preserving Bisimulation Anna Gambin On Approximating the Number of Bases of Exchange Preserving Matroids Leszek Gasieniec, Alan Gibbons, Wojciech Rytter Efficiency of fast parallel pattern-searching in highly compressed texts Wlodzimierz Glazek Lower and Upper Bounds for the Problem of Page Replication in Ring Networks Grzegorz Grudzinski An improved disjunctive strictness analysis for lazy functional languages George Havas, Jean-Pierre Seifert The complexity of the extended GCD problem Ulrich Hertrampf Generalized Regular Counting Classes Hardi Hungar Model Checking and Higher-Order Recursion David Janin, Giacomo Lenzi On the structure of the monadic logic of the binary tree Soren B. Lassen, Andrew Moran Unique Fixed Point Induction for McCarthy's Amb Markus Lohrey Complexity Results for Confluence Problems Yann Loyer, Nicolas Spyratos, Daniel Stamate Computing and Comparing Semantics of Programs in Four-valued Logics Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki On Minimum Edge Ranking Spanning Trees Jan Manuch Multiparty Communication Complexity: Very Hard Functions Luciano Margara On Some Topological Properties of Linear Cellular Automata Klaus Meer Query languages for semi-algebraic databases based on descriptive complexity over $\R$ Peter D. Mosses Foundations of Modular SOS (Extended Abstract) Anca Muscholl, Doron Peled Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces Katsuhiko Nakamura Real-time language recognition by one-way and two-way cellular automata Linh Anh Nguyen A New Space Bound for the Modal Logics K4, KD4 and S4 Cyril Nicaud Average state complexity of operations on unary automata Holger Petersen Fooling Rebound Automata Detlef Sieling The Complexity of Minimizing FBDDs Jitka Stribrna Approximating Weak Bisimulation on Basic Process Algebras Jerzy Tiuryn Type Reconstruction for Functional Programs with Subtyping over a Lattice of Atomic Types Philipp Woelfel Efficient Strongly Universal and Optimally Universal Hashing Tomoyuki Yamakami Quantum Turing Machines with Stationary Head Move Xizhong Zheng, Klaus Weihrauch The Arithmetical Hierarchy of Real Numbers ------------------------------------------------------------------------ End of the list of accepted papers for MFCS'99.