ENGLISH

Mathematical Foundations of Computer Science 2011: 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings

By Filip Murlak , Alexandr Andoni (auth.) , Piotr Sankowski (eds.)

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
2011
ISBN
9783642229930, 364222993X
DOI
10.1007/978-3-642-22993-0
Language
english
Format
PDF
Filesize
7 MB (7704502 bytes)
Series
Lecture Notes in Computer Science 6907 Theoretical Computer Science and General Issues
Edition
1
Pages
618\630
Time added
2013-04-24 17:00:00
Algorithm Analysis and Problem Complexity; Mathema

Description

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.

Similar books