Invited Talks (titles of the talks are tentative) 

CSL/MFCS'98 Plenary Talks 
D. Harel (Rehovot) Towards a Theory of Infinite Recursive Structures and Databases W. Maass (Graz) On the Role of Time and Space in Neural Computations Yu. Matiyasevich (Petersburg) Trace Monoids and their Decision Problems M. Yannakakis (Murray Hill) Testing of Finite State Systems 

MFCS'98 Invited Talks 
G. Ausiello (Rome) Dynamic Algorithms for Directed Hypergraphs and Applications E. Borger (Pisa) Mathematical Analysis of Java programs Yu. Gurevich (Ann Arbor) Logic with Choice R.M. Karp (Seattle) Algorithms for Mapping and Sequencing the Human Genome K. Mehlhorn (Saarbrucken) From Algorithm to Program S. Micali (MITCambridge) ComputationallySound Proofs and Checkers M. Nielsen (Aarhus) Reasoning about the Past A. Pnueli (Rehovot) Modularization and Abstraction: The Keys to Practical Formal Verification P. Pudlak (Prague) On Algorithms for Satisfiability C. Stirling (Edinburgh) The Joys of Bisimulation J. Wiedermann (Prague) Towards Algorithmic Explanation of Mind Evolution and Functioning 

CSL'98 Invited Talks 
P. Hajek (Czech Republic) Trakhtenbrot's theorem and fuzzy logic J. Mitchell (USA) Analysis of security protocols I. Nemeti (Hungary) Connections between Temporal Logics of Programs (Actions), Temporal Logics of Relativity Theory and Logic of Relativity. Th. Schwentick (Germany) Descriptive Complexity and Lower Bounds J. Tiuryn (Poland) Can we Make Subtyping over a Lattice of Atomic Types Practically Feasible? 

MFCS'98 Satellite Workshops (incomplete) 
FICS'98  Fixed Points in Computer Science




mfcs98@fi.muni.cz 