m (Text replacement - "Homepage=" to "Official Website=") |
Curator 100 (talk | contribs) |
||
Line 3: | Line 3: | ||
|Title=18th Fundamentals of Computation Theory | |Title=18th Fundamentals of Computation Theory | ||
|Ordinal=18 | |Ordinal=18 | ||
− | | | + | |In Event Series=Event Series:FCT |
− | | | + | |Single Day Event=no |
+ | |Start Date=2011/08/22 | ||
+ | |End Date=2011/08/25 | ||
+ | |Event Status=as scheduled | ||
+ | |Event Mode=on site | ||
+ | |Venue=University of Oslo | ||
|City=Oslo | |City=Oslo | ||
+ | |Region=Oslo | ||
|Country=Country:NO | |Country=Country:NO | ||
+ | |Academic Field=Computer Science | ||
+ | |Official Website=http://fct11.ifi.uio.no/ | ||
|Submission Link=http://www.easychair.org/conferences?conf=fct2011 | |Submission Link=http://www.easychair.org/conferences?conf=fct2011 | ||
+ | |Type=Symposium | ||
|Has coordinator=Olaf Owe, Martin Steffen | |Has coordinator=Olaf Owe, Martin Steffen | ||
|has general chair=Olaf Owe | |has general chair=Olaf Owe | ||
Line 19: | Line 28: | ||
|pageEditor=User:Curator 75 | |pageEditor=User:Curator 75 | ||
|contributionType=1 | |contributionType=1 | ||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
}} | }} | ||
{{Event Deadline | {{Event Deadline | ||
+ | |Camera-Ready Deadline=2011/06/17 | ||
|Tutorial Deadline=2011/06/06 | |Tutorial Deadline=2011/06/06 | ||
− | |||
|Submission Deadline=2011/04/05 | |Submission Deadline=2011/04/05 | ||
+ | }} | ||
+ | {{Organizer | ||
+ | |Contributor Type=organization | ||
+ | |Organization=University of Oslo | ||
}} | }} | ||
{{Event Metric | {{Event Metric | ||
Line 40: | Line 47: | ||
==Topics== | ==Topics== | ||
Algorithms: | Algorithms: | ||
− | * algorithm design and optimization | + | *algorithm design and optimization |
− | * combinatorics and analysis of algorithms | + | *combinatorics and analysis of algorithms |
− | * computational complexity | + | *computational complexity |
− | * approximation, randomized, and heuristic methods | + | *approximation, randomized, and heuristic methods |
− | * parallel and distributed computing | + | *parallel and distributed computing |
− | * circuits and boolean functions | + | *circuits and boolean functions |
− | * online algorithms | + | *online algorithms |
− | * machine learning and artificial intelligence | + | *machine learning and artificial intelligence |
− | * computational geometry | + | *computational geometry |
− | * computational algebra | + | *computational algebra |
Formal methods: | Formal methods: | ||
− | * algebraic and categorical methods | + | *algebraic and categorical methods |
− | * automata and formal languages | + | *automata and formal languages |
− | * computability and nonstandard computing models | + | *computability and nonstandard computing models |
− | * database theory | + | *database theory |
− | * foundations of concurrency and distributed systems | + | *foundations of concurrency and distributed systems |
− | * logics and model checking | + | *logics and model checking |
− | * models of reactive, hybrid and stochastic systems | + | *models of reactive, hybrid and stochastic systems |
− | * principles of programming languages | + | *principles of programming languages |
− | * program analysis and transformation | + | *program analysis and transformation |
− | * specification, refinement and verification | + | *specification, refinement and verification |
− | * security | + | *security |
− | * type systems | + | *type systems |
Emerging fields: | Emerging fields: | ||
− | * ad hoc, dynamic, and evolving systems | + | *ad hoc, dynamic, and evolving systems |
− | * algorithmic game theory | + | *algorithmic game theory |
− | * computational biology | + | *computational biology |
− | * foundations of cloud computing and ubiquitous systems | + | *foundations of cloud computing and ubiquitous systems |
− | * quantum computation | + | *quantum computation |
Revision as of 14:05, 15 May 2023
Deadlines
|
||
Submission |
|
||
Tutorial |
|
||
Camera-Ready |
Metrics
Submitted Papers
78
Accepted Papers
28
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