Difference between revisions of "FCT 2021"
Jump to navigation
Jump to search
| Line 17: | Line 17: | ||
==Topics== | ==Topics== | ||
| + | Algorithms: | ||
| + | *algorithm design and optimization | ||
| + | *data structures | ||
| + | *combinatorics and analysis of algorithms | ||
| + | *randomized algorithms | ||
| + | *approximation algorithms | ||
| + | *parameterized and exact algorithms | ||
| + | *computational algebra and number theory | ||
| + | *computational geometry | ||
| + | *parallel algorithms | ||
| + | *distributed algorithms and protocols | ||
| + | *online algorithms | ||
| + | *streaming algorithms | ||
| + | *algorithmic game theory | ||
| + | *computational foundations of machine learning | ||
| + | *computational biology | ||
| + | |||
| + | Complexity: | ||
| + | *models of computation | ||
| + | *computational complexity | ||
| + | *decidability | ||
| + | *Boolean/algebraic circuits and functions | ||
| + | *randomized computation | ||
| + | *derandomization | ||
| + | *interactive proofs | ||
| + | *computational foundations of cryptography | ||
| + | *quantum computation | ||
| + | *complexity theory | ||
| + | *lower bounds | ||
| + | *counting complexity | ||
| + | |||
| + | Formal methods: | ||
| + | *algebraic and categorical methods | ||
| + | *automata and formal languages | ||
| + | *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 | ||
| + | *ad hoc, dynamic, and evolving systems | ||
| + | *foundations of cloud computing and ubiquitous systems | ||
| + | |||
| + | |||
==Submissions== | ==Submissions== | ||
| + | |||
| + | |||
==Important Dates== | ==Important Dates== | ||
Abstract registration: May 9, 2021 (AoE)<br> | Abstract registration: May 9, 2021 (AoE)<br> | ||
Revision as of 12:28, 26 April 2021
| FCT 2021 | |
|---|---|
23rd International Symposium on Fundamentals of Computation Theory
| |
| Ordinal | 23 |
| Event in series | FCT |
| Dates | 2021/09/12 (iCal) - 2021/09/15 |
| Homepage: | http://www.corelab.ntua.gr/fct2021/ |
| Location | |
| Location: | Athens, Greece |
| Table of Contents | |
The 23rd International Symposium on Fundamentals of Computation Theory (FCT) 2021
Topics
Algorithms:
- algorithm design and optimization
- data structures
- combinatorics and analysis of algorithms
- randomized algorithms
- approximation algorithms
- parameterized and exact algorithms
- computational algebra and number theory
- computational geometry
- parallel algorithms
- distributed algorithms and protocols
- online algorithms
- streaming algorithms
- algorithmic game theory
- computational foundations of machine learning
- computational biology
Complexity:
- models of computation
- computational complexity
- decidability
- Boolean/algebraic circuits and functions
- randomized computation
- derandomization
- interactive proofs
- computational foundations of cryptography
- quantum computation
- complexity theory
- lower bounds
- counting complexity
Formal methods:
- algebraic and categorical methods
- automata and formal languages
- 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
- ad hoc, dynamic, and evolving systems
- foundations of cloud computing and ubiquitous systems
Submissions
Important Dates
Abstract registration: May 9, 2021 (AoE)
Full paper submission: May 16, 2021 (AoE)
Notification to authors: June 28, 2021
Camera-ready submission: July 6, 2021
Symposium: September 12-15, 2021