You do not have permission to edit this page, for the following reason:
The action you have requested is limited to users in the group: Users.
Add another
The 18th Fundamentals of Computation Theory (FCT) 2011 ==Topics== 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 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 *security *type systems Emerging fields: *ad hoc, dynamic, and evolving systems *algorithmic game theory *computational biology *foundations of cloud computing and ubiquitous systems *quantum computation ==Submissions== The submission drafts should have at most 12 pages and be formated in the LNCS style. The paper should provide sufficient detail to allow the Program Committee to evaluate its validity, quality, and relevance. If necessary, detailed proofs can be attached as an appendix. Simultaneous submission to other conferences with published proceedings or journals is not allowed. Paper submission and reviewing is handled via Easychair: http://www.easychair.org/conferences?conf=fct2011 ==Important Dates== Submission Deadline: Tuesday, 5. April 2011<br> Author Notification: Monday, 6. June 2011<br> Camera ready manuscript: Friday 17. June 2011
Save page Show preview Cancel