This book constitutes the thoroughly refereed conference proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013, held in Klosterneuburg, Austria, in August 2013. The 67 revised full papers presented together with six invited talks were carefully selected from 191 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.38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26- 30, 2013, Proceedings Krishnendu Chatterjee, Jiri Sgall. What is the complexity ... Benkert, M., N Iollenburg, M., Uno, T., Wolff, A.: Minimizing intra-edge crossings in wiring diagrams and public transportation maps. ... 14(4), 423a433 ( 1995) 13.
|Title||:||Mathematical Foundations of Computer Science 2013|
|Author||:||Krishnendu Chatterjee, Jiri Sgall|
|Publisher||:||Springer - 2013-08-16|