Difference between revisions of "FCT 2017"
Jump to navigation
Jump to search
| Line 15: | Line 15: | ||
==Topics== | ==Topics== | ||
| + | |||
| + | |||
| + | Algorithms: | ||
| + | algorithm design and optimization | ||
| + | approximation, randomized, and heuristic methods | ||
| + | circuits and boolean functions | ||
| + | combinatorics and analysis of algorithms | ||
| + | computational algebra | ||
| + | computational and parameterized complexity | ||
| + | computational geometry | ||
| + | distributed and parallel computing | ||
| + | online algorithms | ||
| + | streaming algorithms | ||
| + | |||
| + | Formal methods: | ||
| + | *algebraic and categorical methods | ||
| + | *automata and formal languages | ||
| + | *computability and nonstandard computing models | ||
| + | *database theory | ||
| + | *foundations of concurrency and distributed systems | ||
| + | *logic and model checking | ||
| + | *models of reactive, hybrid and stochastic systems | ||
| + | *principles of programming languages | ||
| + | *program analysis and transformation | ||
| + | *security | ||
| + | *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 information and quantum computing | ||
| + | |||
| + | |||
==Submissions== | ==Submissions== | ||
==Important Dates== | ==Important Dates== | ||
Revision as of 09:49, 26 April 2021
| FCT 2017 | |
|---|---|
21st Fundamentals of Computation Theory
| |
| Ordinal | 21 |
| Event in series | FCT |
| Dates | 2017/09/11 (iCal) - 2017/09/13 |
| Homepage: | fct2017.labri.fr/ |
| Location | |
| Location: | Bordeaux, France |
| Table of Contents | |
The 21st Fundamentals of Computation Theory (FCT) 2017
Topics
Algorithms:
algorithm design and optimization
approximation, randomized, and heuristic methods
circuits and boolean functions
combinatorics and analysis of algorithms
computational algebra
computational and parameterized complexity
computational geometry
distributed and parallel computing
online algorithms
streaming algorithms
Formal methods:
- algebraic and categorical methods
- automata and formal languages
- computability and nonstandard computing models
- database theory
- foundations of concurrency and distributed systems
- logic and model checking
- models of reactive, hybrid and stochastic systems
- principles of programming languages
- program analysis and transformation
- security
- 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 information and quantum computing
Submissions
Important Dates
Abstract registration: May 1, 2017 (AoE)
Full paper submission: May 8, 2017 (AoE)
Notification to authors: June 16, 2017
Final version due: June 28, 2017
Conference dates: September 11-13, 2017