# FCT — International Symposium on Fundamentals of Computation Theory

- **Submission deadline**: 2019-04-14
- **Notification date**: 2019-05-19
- **Conference date**: 2019-08-11
- **Location**: Copenhagen, Denmark
- **Rankings**: CORE B · QUALIS B2
- **Trackers**: 5
- **Attendees**: 0
- **Canonical page**: https://www.myhuiban.com/conference/390

## Acceptance history

| Year | Submitted | Accepted | Rate |
|---|---|---|---|
| 2019 | 45 | 21 | 46.7% |
| 2017 | 99 | 29 | 29.3% |
| 2015 | 60 | 27 | 45% |
| 2013 | 58 | 26 | 44.8% |
| 2011 | 78 | 28 | 35.9% |
| 2009 | 67 | 29 | 43.3% |
| 2007 | 147 | 39 | 26.5% |
| 2005 | 105 | 46 | 43.8% |

## Call for papers

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.

## Related conferences

- FCT' — International Conference on Future Communication Technology — https://www.myhuiban.com/conference/5055
- SIGIR — International Conference on Research and Development in Information Retrieval — https://www.myhuiban.com/conference/141
- AAAI — AAAI Conference on Artificial Intelligence — https://www.myhuiban.com/conference/408
- CVPR — IEEE Conference on Computer Vision and Pattern Recognition — https://www.myhuiban.com/conference/407
- ICRA — International Conference on Robotics and Automation — https://www.myhuiban.com/conference/421

## Related journals

- Photonics and Nanostructures - Fundamentals and Applications — https://www.myhuiban.com/journal/865
- Theory of Computing Systems — https://www.myhuiban.com/journal/547
- Computation — https://www.myhuiban.com/journal/946
- Journal of Control Theory and Applications — https://www.myhuiban.com/journal/503
- IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences — https://www.myhuiban.com/journal/331

---
Source: Conference Partner — https://www.myhuiban.com/conference/390 (rankings reproduced from CCF / ICORE / QUALIS; data cached up to 1 hour)