会议信息

FSTTCS 2026: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science

请登录查看会议网址
免费注册:查看官网链接、跟踪截稿日期,并接收邮件提醒。
截稿日期:
2026-07-04
通知日期:
2026-09-15
会议日期:
2026-12-16
会议地点:
New Delhi, India
届数:
CCF: C   QUALIS: B1   浏览: 40735   关注: 42   参加: 1
嵌入截止倒计时徽章
FSTTCS
用 API 获取这条数据
搜索与榜单列表完全无需凭证;本页的完整详情需要一把免费 API 密钥。详见开发者接入页。

会伴指数 (CP-I)

79.0 / 100
全站第 214 名 / 共 5,695 个会议 · 前 4%

理论与算法 第 15 / 142 软件工程 第 30 / 247

学术认可 (35%)
78
投稿选择性 (20%)
69
会议传承 (20%)
100
社区关注 (10%)
51
资料公开度 (15%)
85

用到的输入: 收录等级:CCF C, QUALIS B1 · 录用率:37.6%(有记录的 5 届的均值) · 有据可查的届次:46 · 在会伴关注它的研究者:42 人 · 过去 24 个月打开过本页的研究者:6 人

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

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

征稿

FSTTCS 2026 (IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science) is a CCF C / QUALIS B1 conference held in New Delhi, India on 2026-12-16. The paper submission deadline is 2026-07-04. Acceptance notifications are sent on 2026-09-15.

FSTTCS 2026 is the 46th conference on Foundations of Software Technology and Theoretical Computer Science. It is organised by IARCS, the Indian Association for Research in Computing Science, in association with ACM India. It is a forum for presenting original results in foundational aspects of Computer Science and Software Technology. Within Track B, there is a focus on soliciting submissions in the areas of Programming Languages and Practical Verification, in addition to theoretical results. FSTTCS 2026 will be held in IIT Delhi during December 16–18, 2026. The conference is being organized as an in-person event. List of Topics Track A Algebraic Complexity Algorithms and Data Structures Algorithmic Graph Theory and Combinatorics Approximation Algorithms Combinatorial Optimization Communication Complexity Computational Geometry Computational Learning Theory Cryptography and Security Data Streaming and Sublinear algorithms Economics and Computation Foundations of Machine Learning Parallel, Distributed and Online Algorithms Parameterized Complexity Proof Complexity Quantum Computing Randomness in Computing Theoretical Aspects of Computational Biology Theoretical Aspects of Mobile and High-Performance Computing Track B Automata, Games and Formal Languages Logic in Computer Science Modal and Temporal Logics Models of Concurrent, Distributed and Mobile Systems Models of Timed, Reactive, Hybrid and Stochastic and Quantum Systems Finite Model Theory and Database Theory Formal Methods Principles and Semantics of Programming Languages Program Analysis and Transformation Specification, Verification and Synthesis Analysis and Verification of AI Theorem Proving and Decision Procedures SAT and SMT solving Formal Analysis of Security and Privacy
由 Admin Agent 最后更新于

录用率

平均录用率: 33.3% 14 年间 (2006–2019).

年份提交数录用数录用率(%)
2019934548.4%
20181234435.8%
20171434128.7%
20161124439.3%
20151174235.9%
20141624729%
20131114036%
20121214335.5%
20111163731.9%
20101283829.7%
20091174034.2%
20081173630.8%
20071354029.6%
20061553421.9%

相关期刊

CCF全称影响因子出版商ISSN
Foundations of Computational Mathematics2.7Springer1615-3375
Electronic Notes in Theoretical Computer ScienceElsevier1571-0661
CKnowledge-Based Systems7.2Elsevier0950-7051
CFuture Generation Computer Systems5.9Elsevier0167-739X
CNeurocomputing6.5Elsevier0925-2312
CPattern Recognition Letters3.9Elsevier0167-8655
CIEEE Transactions on Industrial Informatics11.7IEEE1551-3203
CIEEE Internet of Things Journal8.9IEEE2327-4662
CEngineering Applications of Artificial Intelligence9.0Elsevier0952-1976
CExpert Systems with Applications7.5Elsevier0957-4174

评论 0

暂无评论。

请登录后发表评论