Mathematical Foundations of Computer Science 2011 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011, Proceedings /
Mathematical Foundations of Computer Science 2011 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011, Proceedings / [electronic resource] :
edited by Filip Murlak, Piotr Sankowski.
- 1st ed. 2011.
- XV, 618 p. online resource.
- Theoretical Computer Science and General Issues, 6907 2512-2029 ; .
- Theoretical Computer Science and General Issues, 6907 .
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.
9783642229930
10.1007/978-3-642-22993-0 doi
Algorithms.
Machine theory.
Computer science--Mathematics.
Discrete mathematics.
Computer science.
Artificial intelligence--Data processing.
Algorithms.
Formal Languages and Automata Theory.
Discrete Mathematics in Computer Science.
Theory of Computation.
Data Science.
Computer Science Logic and Foundations of Programming.
QA76.9.A43
518.1
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.
9783642229930
10.1007/978-3-642-22993-0 doi
Algorithms.
Machine theory.
Computer science--Mathematics.
Discrete mathematics.
Computer science.
Artificial intelligence--Data processing.
Algorithms.
Formal Languages and Automata Theory.
Discrete Mathematics in Computer Science.
Theory of Computation.
Data Science.
Computer Science Logic and Foundations of Programming.
QA76.9.A43
518.1