MFCS'98 Satellite Workshops
The Current State to April 24, 1998
Date: August, 24-27
Topics: All aspects of computability and computational complexity with emphasis on the Turing machine model of computation.
PC: Ker-I Ko (Stony Brook), A. Nerode (Cornell University), M. Pour-El (Minnessota), K. Weihrauch (chair, Hagen), J. Wiedermann (Prague).
Deadline: May 25, 1998
Contact: Klaus.Weihrauch@fernuni-hagen.de
Date: August, 27-28
Topics: Construction and reasoning about properties of fixed points in various models, algebras, and logics.
PC: R. Backhouse (Eindhoven), S.L. Bloom (Hoboken), C. Boehm (Rome), R. De Nicola (Florence), Z. Esik (chair, Szeged), P. Freyd (Philadelphia), I. Guessarian (Paris), D. Kozen (Cornell), W. Kuich (Vienna), M.Mislove (Tulane), R.F.C. Walters (Sydney).
Deadline: May 25, 1998
Contact: esik@inf.u-szeged.hu
Date: August, 24-25
Topics: Frontiers between decidable and undecidable (halting) problems in various computational settings. (Turing machines, register machines, cellular automata, tiling of the plane, polyominos, snakes, neural networks, molecular computations, word processing (in groups and monoids)), or in analog computations (BSS machines, infinite cellular automata, real machines, hybrid systems).
PC: J. Gabarro (Barcelona), I. Korec (Bratislava), Yu. Rogozhin (Kishinev), M. Margenstern (co-chair, Metz), G. Mauri (Milan), K. Morita (co-chair, Hiroshima), G. Paun (Bucharest).
Deadline: May 25, 1998
Contact: margens@antares.iut.univ-metz.fr
Date: August, 27-28
Topics: Mathematical and logical foundations and methods in linguistics.
PC: E. Csuhaj-Varju (Budapest), M. Kudlek (Hamburg).
Deadline: May 25, 1998
Contact: kudlek@informatik.uni-hamburg.de
Date: August, 25-27
Topics: All aspects of cellular automata (models of parallelism, complex systems, dynamical systems, interactive behaviour, physical systems, models of biological systems, cellular automata machines).
PC: G. Cattaneo (Milano), B. Durand (Lyon), M. Garzon (Memphis), G. Mauri (Milano), J. Mazoyer (Lyon), H. Umeo (Osaka), R. Vollmar (chair, Karlsruhe), T. Worsch (Karlsruhe).
Deadline: May 25, 1998
Contact: vollmar@ira.uka.de, worsch@ira.uka.de
Date: August, 24-26
Topics: Communication complexity (two-party and multi-party protocols) communication algorithms in networks (gossipping, routing and broadcasting) interactive and zero-knowledge proofs, cryptography and cryptographical protocols.
PC: M. Dietzfelbinger (Dortmund), P.Duris (Bratislava), J. Hromkovic (chair, Aachen), R. Klasing (Warwick), A. Liestman (Burnaby), A. Pelc (Hull), G. Schnitger (Frankfurt), J. Sgall (Prague), W. Unger (Paderborn)
Deadline: March 20, 1998
Contact: jh@I1.Informatik.RWTH-Aachen.de
Date: August, 27-28
Topics: Decidability and complexity issues, model checking, software tools for modelling and verification of concurrent systems, verification of infinite-state processes.
PC: A. Bouajjani (Grenoble), J. Bradfield (Edinburgh), W. Brauer (Munich), P. Jancar (co-chair, Ostrava), M. Kretinsky (co-chair, Brno), M. Nielsen (Aarhus), C. Stirling (Edinburgh).
Deadline: May 25, 1998
Contact: mojmir@fi.muni.cz
Date: August, 22-23
Topics: Cooperating/distributed grammar systems, colonies, team grammar systems, eco-grammar systems, network and language processors.
PC: E. Csuhaj-Varju (Budapest), J. Dassow (Magdeburg), J. Kelemen (Bratislava/Opava), A. Kelemenova (chair, Opava), G. Paun (Bucharest, Turku), D. Wotschke (Franfurkt).
Deadline: May 31, 1998
Contact: kelemenova@fpf.slu.cz
Date: August, 24-26
Topics: Any theoretical computer science directions of research on the possible use of DNA as a support for computation.
PC: C. Calude (Auckland), T. Head (Binghamton), L. Kari (London-Ontario), K. Krithivasan (Madras), G. Paun (chair, Bucharest), T. Yokomori (Tokyo).
Deadline: May 25, 1998
Contact: gpaun@imar.ro
Date: August, 26-28
Topics: Design and analysis of randomized algorithms, derandomization, randomized complexity classes.
PC: S. Arikawa (Fukuoka), S. Arora (Princeton), H. Buhrman (Amsterdam), C. Calude (Auckland), L. Fortnow (Chicago), R. Freivalds (chair, Riga), J. Hromkovic (Aachen), R. Impagliazzo (San Diego), L. Kucera (Prague), Ming Li (Waterloo), A. Lingas (Lund), S. Rajasekaran (Gainesville), J. Rolim (Geneva), O. Watanabe (Tokyo), R. Wiehagen (Kaiserslautern), T. Zeugmann (Fukuoka).
Deadline: March 20, 1998
Contact: rusins@paul.cclu.lv
Date: August, 27-28
Topics: Weak arithmetics, complexity of logical theories, complexity of algorithms in number theory, recursive analysis.
PC: P. Cegielski (chair, Paris), I. Korec (Bratislava), Y. Matyiasevich (Petersburg), D. Richard (Clermont-Ferrand).
Deadline: March 20, 1998
Contact: cep@capella.liafa.jussieu.fr
Date: August, 29-30
Topics:Category theory, sheaves, logic, applications to computer science.
PC: None.
Deadline: August 29, 1998
Contact: rosicky@math.muni.cz
