Difference between revisions of "FCT 2019"
Jump to navigation
Jump to search
| Line 21: | Line 21: | ||
==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 biology | ||
| + | |||
| + | Complexity: | ||
| + | models of computation | ||
| + | computational complexity | ||
| + | decidability | ||
| + | Boolean/algebraic circuits and functions | ||
| + | randomized computation | ||
| + | derandomization | ||
| + | interactive proofs | ||
| + | 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== | ||
Revision as of 12:03, 26 April 2021
| FCT 2019 | |
|---|---|
22nd Fundamentals of Computation Theory
| |
| Ordinal | 22 |
| Event in series | FCT |
| Dates | 2019/08/12 (iCal) - 2019/08/14 |
| Homepage: | https://di.ku.dk/fct2019/ |
| Location | |
| Location: | Copenhagen, Denmark |
| Committees | |
| General chairs: | Thomas Hildebrandt |
| PC chairs: | Leszek Gasieniec, Jesper Jansson |
| Keynote speaker: | Libor Barto, Bernard Chazelle, Kousha Etessami, Torben Hagerup |
| Table of Contents | |
The 22nd Fundamentals of Computation Theory (FCT) 2019
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 biology
Complexity:
models of computation computational complexity decidability Boolean/algebraic circuits and functions randomized computation derandomization interactive proofs 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