Mathematical Foundations of Computer Science 2011
This volume constitutes the refereed proceedings of the 36th International Symposium on Mathematical Foundations of Computer Science, MFCS 2011, held in Warsaw, Poland, in August 2011. The 48 revised full papers presented together with 6 invited talks were carefully reviewed and selected from 129 submissions. Topics covered include algorithmic game theory, algorithmic learning 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, and theoretical issues in artificial intelligence.
| ISBN: | 9783642229923 |
|---|---|
| Sprache: | Englisch |
| Seitenzahl: | 618 |
| Produktart: | Kartoniert / Broschiert |
| Herausgeber: | Murlak, Filip Sankowski, Piotr |
| Verlag: | Springer Berlin |
| Veröffentlicht: | 09.08.2011 |
| Untertitel: | 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011, Proceedings |
| Schlagworte: | algorithm analysis and problem complexity constraint optimization data structures finite automata graph drawing modal logic weighted polymorphisms |