2021年6月最新SCI期刊列表已更新,欢迎查询使用! 如果您对期刊系统有任何需求或者问题,欢迎
反馈给我们。 ![]() |
基本信息 | 登录收藏 | |||||||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
期刊名字 | THEORETICAL COMPUTER SCIENCE THEOR COMPUT SCI LetPub评分 5.2
51人评分
我要评分
声誉 6.3 影响力 4.1 速度 6.4 | |||||||||||||||||||||
期刊ISSN | 0304-3975 | 微信扫码收藏此期刊 | ||||||||||||||||||||
2020-2021最新IF (数据来源于搜索引擎) | 登录后查看IF和趋势图 | |||||||||||||||||||||
2020-2021自引率 | 20.90%登录查看自引率趋势图 | |||||||||||||||||||||
h-index | 105 | |||||||||||||||||||||
CiteScore |
| |||||||||||||||||||||
期刊简介 | Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. All papers introducing or studying mathematical, logic and formal concepts and methods are welcome, provided that their motivation is clearly drawn from the field of computing. | |||||||||||||||||||||
期刊官方网站 | http://www.journals.elsevier.com/theoretical-computer-science/ | |||||||||||||||||||||
期刊投稿网址 | https://www.editorialmanager.com/TCS | |||||||||||||||||||||
是否OA开放访问 | No | |||||||||||||||||||||
通讯方式 | ELSEVIER SCIENCE BV, PO BOX 211, AMSTERDAM, NETHERLANDS, 1000 AE | |||||||||||||||||||||
出版商 | Elsevier | |||||||||||||||||||||
涉及的研究方向 | 工程技术-计算机:理论方法 | |||||||||||||||||||||
出版国家或地区 | NETHERLANDS | |||||||||||||||||||||
出版语言 | English | |||||||||||||||||||||
出版周期 | Biweekly | |||||||||||||||||||||
出版年份 | 1975 | |||||||||||||||||||||
年文章数 | 557登录查看年文章数趋势图 | |||||||||||||||||||||
Gold OA文章占比 | 2.45% | |||||||||||||||||||||
研究类文章占比: 文章 ÷(文章 + 综述) | 100.00% | |||||||||||||||||||||
WOS期刊SCI分区 ( 2020-2021年最新版) | WOS分区等级:4区
| |||||||||||||||||||||
中科院《国际期刊预警 名单(试行)》名单 | 2021年12月发布的2021版:不在预警名单中 2021年01月发布的2020版:不在预警名单中 | |||||||||||||||||||||
中科院SCI期刊分区 ( 2021年12月最新基础版) | 登录查看中科院JCR分区趋势图
| |||||||||||||||||||||
中科院SCI期刊分区 ( 2021年12月最新升级版) |
| |||||||||||||||||||||
中科院SCI期刊分区 ( 2020年12月旧的升级版) |
| |||||||||||||||||||||
SCI期刊收录coverage | Science Citation Index (已不再单独更新,统称SCIE) Science Citation Index Expanded (SCIE) Scopus (CiteScore) | |||||||||||||||||||||
PubMed Central (PMC)链接 | http://www.ncbi.nlm.nih.gov/nlmcatalog?term=0304-3975%5BISSN%5D | |||||||||||||||||||||
平均审稿速度 | 网友分享经验: 平均4.5个月 来源Elsevier官网: 平均26.2周 | |||||||||||||||||||||
平均录用比例 | 网友分享经验: 容易 | |||||||||||||||||||||
在线出版周期 | 来源Elsevier官网: 平均14.8周 | |||||||||||||||||||||
期刊常用信息链接 |
|
|
|
|
登录查看自引率趋势图 |
登录查看中科院JCR分区趋势图 |
登录查看年文章数趋势图 |
中国学者近期发表的论文 | |
1. | Distributed representation of knowledge graphs with subgraph-aware proximity Author: Xiao Han, Chunhong Zhang, Chenchen Guo, Tingting Sun, Yang Ji Journal: THEORETICAL COMPUTER SCIENCE, 2019, Vol., , DOI:10.1016/j.tcs.2019.03.033 DOI |
2. | The h-extra connectivity of k-ary n-cubes Author: Aixia Liu, Shiying Wang, Jun Yuan, Xue Ma Journal: THEORETICAL COMPUTER SCIENCE, 2019, Vol., , DOI:10.1016/j.tcs.2019.03.030 DOI |
3. | A random algorithm for profit maximization in online social networks Author: Tiantian Chen, Bin Liu, Wenjing Liu, Qizhi Fang, Jing Yuan, Weili Wu Journal: THEORETICAL COMPUTER SCIENCE, 2019, Vol., , DOI:10.1016/j.tcs.2019.03.028 DOI |
4. | Edge fault tolerance of graphs with respect to λ2-optimal property Author: Yaoyao Zhang, Shuang Zhao, Jixiang Meng Journal: THEORETICAL COMPUTER SCIENCE, 2019, Vol., , DOI:10.1016/j.tcs.2019.03.024 DOI |
5. | Numerical P systems with Boolean condition Author: Liucheng Liu, Wenmei Yi, Qian Yang, Hong Peng, Jun Wang Journal: THEORETICAL COMPUTER SCIENCE, 2019, Vol., , DOI:10.1016/j.tcs.2019.03.021 DOI |
6. | Profit Maximization problem with Coupons in social networks Author: Bin Liu, Xiao Li, Huijuan Wang, Qizhi Fang, Junyu Dong, Weili Wu Journal: THEORETICAL COMPUTER SCIENCE, 2019, Vol., , DOI:10.1016/j.tcs.2019.03.007 DOI |
7. | Viral marketing of online game by DS decomposition in social networks Author: Chuangen Gao, Hai Du, Weili Wu, Hua Wang Journal: THEORETICAL COMPUTER SCIENCE, 2019, Vol., , DOI:10.1016/j.tcs.2019.03.006 DOI |
8. | A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem Author: Yishuo Shi, Yingli Ran, Zhao Zhang, Ding-Zhu Du Journal: THEORETICAL COMPUTER SCIENCE, 2019, Vol., , DOI:10.1016/j.tcs.2019.03.004 DOI |
9. | Efficient approximation algorithms for maximum coverage with group budget constraints Author: Longkun Guo, Min Li, Dachuan Xu Journal: THEORETICAL COMPUTER SCIENCE, 2019, Vol., , DOI:10.1016/j.tcs.2019.02.015 DOI |
10. | On the abelian complexity of generalized Thue-Morse sequences Author: Jin Chen, Zhi-Xiong Wen Journal: THEORETICAL COMPUTER SCIENCE, 2019, Vol., , DOI:10.1016/j.tcs.2019.02.014 DOI |
|
|
首页 上一页 1 下一页 尾页 (去 | |
以上SCI期刊相关数据和信息来源于网络,仅供参考。
投稿状态统计: 我要评分: | |
同领域作者分享投稿经验:共7条 (包含回复) |
我来分享 |
|
联系我们 | 站点地图 | 友情链接 | 授权代理商 | 加入我们
© 2010-2022 中国: LetPub上海分公司 网站备案号:沪ICP备10217908号-1 沪公网安备号:31010402006960
增值电信业务经营许可证:沪B2-20211595
礼翰商务信息咨询(上海)有限公司 办公地址:上海市徐汇区漕溪北路88号圣爱大厦2103室
United States: Tel: 1-781-202-9968 Address: 400 5th Ave, Suite 530, Waltham, Massachusetts 02451