会议信息

FCT 2019: International Symposium on Fundamentals of Computation Theory

请登录查看会议网址
免费注册：查看官网链接、跟踪截稿日期，并接收邮件提醒。
注册 登录
截稿日期:
2019-04-14 已截稿
通知日期:
2019-05-19
会议日期:
2019-08-11
会议地点:
Copenhagen, Denmark
届数:
22
ICORE: B   QUALIS: B2   浏览: 29338   关注: 5   参加: 0
这一页信息有误？告诉我们
嵌入截止倒计时徽章
FCT
用 API 获取这条数据
搜索与榜单列表完全无需凭证；本页的完整详情需要一把免费 API 密钥。详见开发者接入页。

会伴指数 (CP-I)

66.0 / 100
全站第 419 名 / 共 5,696 个会议 · 前 8%
学术认可 (35%)
72
投稿选择性 (20%)
66
会议传承 (20%)
84
社区关注 (10%)
26
资料公开度 (15%)
55

用到的输入: 收录等级：ICORE B, QUALIS B2 · 录用率：40.3%（有记录的 5 届的均值） · 有据可查的届次：22 · 在会伴关注它的研究者：5 人 · 过去 24 个月打开过本页的研究者：2 人

公开资料里还缺: 历届信息 (+3.0) · 最佳论文记录 (+2.3)
主办方认领本会议后，可直接在这一页补上；分数每晚重算。如何提升这个分数

置信度 100% —— 分数中有多大比例来自实际观测到的数据，而不是中性基准。 这个分数是怎么算出来的 · 查看完整榜单 · 算法版本 1.1 · 算于 2026-10-13

征稿

FCT 2019 (International Symposium on Fundamentals of Computation Theory) is a ICORE B / QUALIS B2 conference held in Copenhagen, Denmark on 2019-08-11. The paper submission deadline is 2019-04-14 (extended). Acceptance notifications are sent on 2019-05-19.

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.
由 Dou Sun 最后更新于

录用率

平均录用率: 39.4% 8 年间 (2005–2019).

年份提交数录用数录用率(%)
2019452146.7%
2017992929.3%
2015602745%
2013582644.8%
2011782835.9%
2009672943.3%
20071473926.5%
20051054643.8%

相关会议

相关期刊

评论 0

暂无评论。

请登录后发表评论