28 Nov. 2011
LNCS proceedings is available online
25 August 2011
Pictures from the conference are now on the web.
15 August 2011
Online Registration is closed, but OnSite registration is possible.
26 July 2011
Updated info about venue, etc.
18 June 2011
13 June 2011
EXTENSION: Doctoral Symposium has the submission site open for 12 more hours (i.e., until midnight, Oslo time).
7 June 2011
Registration page for the main conference is open.
6 June 2011
Author notification: list of accepted papers available
03 June 2011
Submission site opened for the Doctoral Symposium.
04 Apr. 2011
Deadline Extension: submission deadline has been extended to 14 April (midnight Hawaii time)
29 Mar. 2011
Sponsorships are available for participants. See Registration page for details on eligibility criteria.
16 Feb. 2011
FCT 2011 is honored by the invited speakers:
11 Feb. 2011
One can use the FCT11 Posters for display with the purpose of advertising the FCT 2011 symposium.
31 Jan. 2011
10 Jan. 2011
First call for workshops is out
15 Dec. 2010
First call for papers is out
14 Dec. 2010
Web Page is up
18th International Symposium on Fundamentals of Computation Theory
August 22-25, 2011
LNCS proceedings is available online here.
The Symposium on Fundamentals of Computation Theory was established in 1977 for researchers interested in all aspects of theoretical computer science, as well as new emerging fields such as bio-inspired computing. It is a biennial series of conferences previously held in Poznan (Poland, 1977), Wendisch-Rietz (Germany, 1979), Szeged (Hungary, 1981), Borgholm (Sweden, 1983), Cottbus (Germany, 1985), Kazan (Russia, 1987), Szeged (Hungary, 1989), Gosen-Berlin (Germany, 1991), Szeged (Hungary, 1993), Dresden (Germany, 1995), Krakow (Poland, 1997), Iasi (Romania, 1999), Riga (Latvia, 2001), Malmo (Sweden, 2003), Lubeck (Germany, 2005), Budapest (Hungary, 2007), and Wroclaw (Poland, 2009).
- 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 artificial intelligence
- computational geometry
- computational algebra
- Formal methods:
- algebraic and categorical methods
- automata and formal languages
- computability and nonstandard computing models
- database theory
- foundations of concurrency and distributed systems
- logics and model checking
- models of reactive, hybrid and stochastic systems
- principles of programming languages
- program analysis and transformation
- specification, refinement and verification
- type systems
- Emerging fields:
- ad hoc, dynamic, and evolving systems
- algorithmic game theory
- computational biology
- foundations of cloud computing and ubiquitous systems
- quantum computation
|Extended to:||Thursday, 14. April 2011|
|(midnight Hawaii time)|
|Author Notification:||Monday, 6. June 2011|
|Camera ready manuscript:||Friday 17. June 2011|
Please follow the links on the left for further information about the conference.