Authors are invited to submit original research papers in all areas related to the foundations of computer science (algorithms, complexity, and formal methods).

About the symposium

The Symposium on Fundamentals of Computation Theory (FCT) was established in 1977 for researchers interested in all aspects of theoretical computer science, and in particular in algorithms, complexity, formal and logical methods. FCT is a biennial conference that circulates on a regular basis in Eastern Europe, Western Europe, and the Nordic countries.

Scope

The program committee is soliciting original and significant research contributions to the fundamentals of computation theory, including but not limited to:

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

Proceedings

Symposium proceedings will be published in the ARCoSS subline of the Springer Lecture Notes in Computer Science [LNCS] series.