Difference between revisions of "FCT 2011"
Jump to navigation
Jump to search
| Line 14: | Line 14: | ||
==Topics== | ==Topics== | ||
| − | + | 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: | ||
Revision as of 11:51, 21 April 2021
| FCT 2011 | |
|---|---|
18th Fundamentals of Computation Theory
| |
| Ordinal | 18 |
| Event in series | FCT |
| Dates | 2011/08/22 (iCal) - 2011/08/25 |
| Homepage: | http://fct11.ifi.uio.no/ |
| Location | |
| Location: | Oslo, Norway |
| Table of Contents | |
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:
o algebraic and categorical methods
o automata and formal languages
o computability and nonstandard computing models
o database theory
o foundations of concurrency and distributed systems
o logics and model checking
o models of reactive, hybrid and stochastic systems
o principles of programming languages
o program analysis and transformation
o specification, refinement and verification
o security
o type systems
- Emerging fields:
o ad hoc, dynamic, and evolving systems
o algorithmic game theory
o computational biology
o foundations of cloud computing and ubiquitous systems
o quantum computation