Fundamentals of Computation Theory

The Symposium on Fundamentals of Computation Theory was established in 1977 for researchers interested in all aspects of theoretical computer science, in particular in algorithms, complexity, and formal and logical methods. It is a biennialconference,whichhaspreviouslybeenheldinPoznan ´ (1977),Wendisch- Rietz (1979), Szeged (1981), Borgholm (1983), Cottbus (1985), Kazan (1987), Szeged (1989), Gosen-Berlin (1991), Szeged (1993), Dresden (1995), Krak´ ow (1997), Ia¸ si (1999), Riga (2001), Malmo ¨ (2003), Lu ¨beck (2005) and Budapest (2007). The17thInternationalSymposiumonFundamentalsofComputationTheory (FCT2009)washeldinWroclaw,September2-4,2009,andwasorganizedjointly by the Institute of Mathematics and Computer Science ofWroc lawUniversity of Technology and the Institute of Computer Science, University of Wrocla w. The conference was held at Wroc law University of Technology. The suggested topics of FCT 2009 included, but were not limited to: Algorithms: algorithm design and optimization; combinatorics and analysis of algorithms; computational complexity; approximation, randomized, and heuristic methods; parallel and distributed computing; circuits and Boolean functions; online algorithms; machine learning and arti?cial intelligence; computational geometry; computational algebra Formal methods: automata and formal languages; computability and nonst- dardcomputingmodels;algebraicandcategoricalmethods;logicsandmodel checking; principles of programming languages; program analysis and tra- formation; speci?cation, re?nement and veri?cation; type systems; conc- rency theory;databasetheory,semi-structureddata and?nite model theory; models of reactive, hybrid and stochastic systems Emerging ?elds: security and cryptography; ad hoc and mobile systems; qu- tum computation; computational biology; high-performance computing; - gorithmic game theory The Program Committee invited lectures from Martin Dietzfelbinger (Il- nau), Thomas A.