Mathematical Foundations of Computer Science
August 25-29, 1997, Bratislava, Slovakia
The series of MFCS symposia, organized alternately in the Czech Republic, Poland and Slovakia since 1972, has a long and well-established tradition. The MFCS symposia encourage high-quality research in all branches of theoretical computer science. Their broad scope provides an opportunity to bring together specialists who do not usually meet at specialized conferences. Papers presenting original research on theoretical aspects of computer science are sought.
Principal topics of interest include (but are not limited to): algorithms and data structures, automata and formal languages, complexity and computability, concurrency theory, computational geometry, cryptography and security, data bases and knowledge-based systems, foundations of declarative programming, formal specifications and program development, models of computation, parallel and distributed computing, semantics and logics of programs, theoretical issues in artificial intelligence.
The symposium is organized by the Slovak Society for Computer Science and the Comenius University in Bratislava in cooperation with other institutions in Slovakia, and is supported by the European Association for Theoretical Computer Science.