Mathematical Foundations of Computer Science 2009: 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009, Proceedings
Rastislav Královic, Damian Niwinski
Springer Science & Business Media, Aug 6, 2009 - Computers - 760 pages
This book constitutes the refereed proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science, MFCS 2009, held in Novy Smokovec, High Tatras, Slovakia, in August 2009. The 56 revised full papers presented together with 7 invited lectures were carefully reviewed and selected from 148 submissions. All current aspects in theoretical computer science and its mathematical foundations are addressed, including algorithmic game theory, algorithmic tearning 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, theoretical issues in artificial intelligence.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
agents automata automaton bent functions Berlin Heidelberg 2009 binary Boolean Boolean functions chordal graphs circuit color complexity Computer Science conﬁguration consider construction Corollary corresponding deﬁned Deﬁnition denote deterministic diﬀerent edge exists finitary ﬁnite ﬁrst ﬁxed ﬂap ﬂow forall forany formula function game graphs given grammar graph G Heidelberg Hence hybrid logics induced subgraphs inﬁnite input integer intersection graphs interval graph isan isomorphism Kolmogorov complexity labelled languages Lemma length Let G linear LNCS logic lower bound MFCS monomial node NP-complete NP-hard obtained optimal output pair parity partition path player polynomial position problem proof proof net properties protocol pushdown quantum query random reduction resp satisﬁability semiring sequence Springer strategy structure subgraph submodular subset symbol Theorem TNFGs transition tree treewidth upper bound variables vector vertex vertices weshow winning word XPath zero