(mobo import Concept___Events-migrated) |
(mobo import Concept___Events-migrated) |
||
| Line 4: | Line 4: | ||
|Ordinal=18 | |Ordinal=18 | ||
|Type=Symposium | |Type=Symposium | ||
| − | |||
|Homepage=http://fct11.ifi.uio.no/ | |Homepage=http://fct11.ifi.uio.no/ | ||
|City=Oslo | |City=Oslo | ||
|Country=Country:NO | |Country=Country:NO | ||
| − | |||
| − | |||
|Submitting link=http://www.easychair.org/conferences?conf=fct2011 | |Submitting link=http://www.easychair.org/conferences?conf=fct2011 | ||
|Has coordinator=Olaf Owe, Martin Steffen | |Has coordinator=Olaf Owe, Martin Steffen | ||
| Line 15: | Line 12: | ||
|has program chair=Olaf Owe, Martin Steffen, Jan Arne Telle | |has program chair=Olaf Owe, Martin Steffen, Jan Arne Telle | ||
|has workshop chair=Volker Stolz | |has workshop chair=Volker Stolz | ||
| − | |||
|Submitted papers=78 | |Submitted papers=78 | ||
|Accepted papers=28 | |Accepted papers=28 | ||
| Line 32: | Line 28: | ||
|Event Mode=on site | |Event Mode=on site | ||
}} | }} | ||
| + | {{Event Deadline | ||
| + | |Tutorial Deadline=2011/06/06 | ||
| + | |Camera-Ready Deadline=2011/06/17 | ||
| + | |Submission Deadline=2011/04/05 | ||
| + | }} | ||
| + | {{S Event}} | ||
The 18th Fundamentals of Computation Theory (FCT) 2011 | The 18th Fundamentals of Computation Theory (FCT) 2011 | ||
Revision as of 19:35, 22 September 2022
Deadlines
|
||
| Submission |
|
||
| Tutorial |
|
||
| Camera-Ready |
Venue
University of Oslo, Oslo, Norway
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
Author Notification: Monday, 6. June 2011
Camera ready manuscript: Friday 17. June 2011
