ENGLISH

Mathematical Foundations of Computer Science 2012: 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings

By Georg Gottlob , Vladimiro Sassone , Branislav Rovan , Peter Widmayer (eds.) , Marco Manna , Michael Morak (auth.)

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
2012
ISBN
9783642325892, 3642325890
DOI
10.1007/978-3-642-32589-2
Language
english
Format
PDF
Filesize
11 MB (11070989 bytes)
Series
Lecture Notes in Computer Science 7464 Theoretical Computer Science and General Issues
Edition
1
Pages
825\852
Time added
2013-04-24 17:00:00
Algorithm Analysis and Problem Complexity; Discret

Description

This volume constitutes the refereed proceedings of the 37th International Symposium on Mathematical Foundations of Computer Science, MFCS 2012, held in Bratislava, Slovakia, in August 2012. The 63 revised full papers presented together with 8 invited talks were carefully reviewed and selected from 162 submissions. Topics covered include algorithmic game theory, algorithmic learning theory, algorithms and data structures, automata, formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, databases and knowledge-based systems, foundations of computing, logic in computer science, models of computation, semantics and verification of programs, and theoretical issues in artificial intelligence.

Similar books