Mathematical Foundations of Computer Science 2013 Edited Conference Proceeding


Editor(s): Chatterjee, Krishnendu; Sgall, Jiří
Title: Mathematical Foundations of Computer Science 2013
Title Series: LNCS
Affiliation IST Austria
Abstract: 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.
Keywords: Temporal logic; satisfiability; approximation algorithms; finite automata; proof complexity
Publication Title: Mathematical Foundations of Computer Science 2013
Volume: 8087
Date Range: August 26-30, 2013
Conference Location: Klosterneuburg, Austria
ISBN: 978-364240312-5
Publisher: Springer  
Publication Place: Berlin
Date Published: 2013-08-08
Start Page: VI
End Page: 854
URL:
DOI: 10.1007/978-3-642-40313-2
Open access: no
IST Austria Authors