ENGLISH

Mathematical Foundations of Computer Science 2009: 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings

By Rastislav Královič , Albert Atserias (auth.) , Damian Niwiński (eds.)

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
2009
ISBN
3642038158, 9783642038150
DOI
10.1007/978-3-642-03816-7
LCC
QA76.9.M35 S96 2009
Open Library ID
OL25092180M
Language
english
Format
PDF
Filesize
9 MB (9528385 bytes)
Series
Lecture Notes in Computer Science 5734 : Theoretical Computer Science and General Issues
Edition
1
Pages
760\772
Topic
Computers
Time added
2011-06-04 13:46:07
Algorithm Analysis and Problem Complexity; Computa

Description

This book constitutes the refereed proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science, MFCS 2009, held in Novy Smokovec, High Tatras, Slovakia, in August 2009. The 56 revised full papers presented together with 7 invited lectures were carefully reviewed and selected from 148 submissions. All current aspects in theoretical computer science and its mathematical foundations are addressed, including algorithmic game theory, algorithmic tearning theory, algorithms and data structures, automata, grammars and formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, cryptography and security, databases and knowledge-based systems, formal specifications and program development, foundations of computing, logic in computer science, mobile computing, models of computation, networks, parallel and distributed computing, quantum computing, semantics and verification of programs, theoretical issues in artificial intelligence.

Similar books