The series of MFCS symposia, organized alternately in Poland, Slovakia and the Czech Republic since 1972 has a long and well-established tradition. The MFCS symposia encourage high-quality research in all branches of theoretical computer science and provide an opportunity to bring together specialists working in the area. Papers presenting original research on theoretical aspects of computer science are sought. The scientific program will include invited lectures covering the areas of main interest and original contributing talks. The topics include (but are not restricted to) algorithm and data structures (including sequential, parallel, distributed, approximation, graph, network, number-theory, and on-line algorithms), automata, grammars and formal languages, complexity theory (structural and computational), computational biology, computational geometry, concurrency theory, cryptography and security, databases and knowledge-based systems, foundations of programming, formal specifications and program development, machine learning, models of computations (parallel and distributed computed, fixed parameter tractability, quantum computing, and other), semantics and logics of programs, and theoretical issues in artificial intelligence.
|
