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.

Submission Guidelines

Authors are invited to submit high-quality manuscripts reporting original unpublished research in the topics covered by the symposium. Simultaneous submission to other conferences or workshops with published proceedings is not allowed. If relevant, authors have to disclose information on strongly-related papers that are in the publication or reviewing pipeline elsewhere. It is required that each accepted paper will be presented at the symposium by one of its authors.

Submissions must not exceed 12 pages (excluding references), formatted according to the LNCS style plus an optional, clearly marked appendix of reasonable length (to be read at the discretion of the program committee). The first page must include an indication of whether the paper is eligible for the best student paper award.

Papers are to be submitted electronically through EasyChair at the following link: [Log in to EasyChair for FCT 2019]. NEW DEADLINE FOR SUBMISSION OF FULL PAPERS AND NEW PAPERS: 14th of APRIL, TIME 24.00 AoE (Anywhere on Earth) (please ignore the old submission deadlines which may still appear at some web sites)

List of Topics

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

Committees

Program Committee

Steering Committee

Organizing Committee

Proceedings

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

Special Issue

Selected papers will be invited to a special issue of the Journal of Computer and System Sciences [JCSS], devoted to FCT 2019.

Awards

Awards will be given to the best paper and the best student paper. To be eligible for the best student paper award, at least one of the paper authors must be a full-time student at the time of submission, and the student(s) must have made a significant contribution to the paper.

Venue

FCT 2019 will take place in Copenhagen, the capital of Denmark, at one of the oldest universities in Europe: University of Copenhagen. You can find more information on the host in the following websites:

• [Department of Computer Science]
• [Faculty of Science]
• [University of Copenhagen].

Contact

All questions about submissions should be emailed to a co-chair of the program committee (see above). For other questions regarding the conference you may contact Thomas Hildebrandt.