提供学术论文选刊润色服务

计算机科学

返回期刊列表

Review Cycle Records

ACTA INFORMATICA

Springer SCIE 非OA

2026新锐 4区2025中科院 4区2025 JCR Q4

查看审稿周期计算与数据来源报告数据问题

395.7平均天数

220中位天数

154最短天数

1,119最长天数

342025发文量

Paper Review Records

全部论文审稿周期

15 篇有效样本 · 按发表日期由新到旧排列
审稿天数=录用日期-收稿日期；保留 PDF/DOI/网页源链接

1,119 天

Practically-self-stabilizing vector clocks without scheduling fairness

收稿 2023-06-07 录用 2026-06-30 发表 2026-08-20

作者Iosif Salem; Elad M. Schiller

作者单位1. Department of Computer Science and Engineering, Chalmers University of Technology, Göteborg, Sweden

PDF源文件 DOI 网页

216 天

Incremental–decremental maximization

收稿 2025-12-30 录用 2026-08-03 发表 2026-08-14

作者Yann Disser; Max Klimm; Annette Lutz; Lea Strubberg

作者单位1. TU Darmstadt, Darmstadt, Germany; 2. TU Berlin, Berlin, Germany

PDF源文件 DOI 网页

154 天

Fast pattern matching with epsilon transitions

收稿 2025-10-27 录用 2026-03-30 发表 2026-08-04

作者Nicola Cotumaccio

作者单位1. Department of Computer Science, University of Helsinki, Helsinki, Finland

PDF源文件 DOI 网页

194 天

Tile-based knot assembly with Celtic!

收稿 2025-11-01 录用 2026-05-14 发表 2026-07-22

作者Divya Bajaj; Ryan Knobel; Juan Manuel Perez; Rene Reyes; Ramiro Santos; Tim Wylie

作者单位1. Department of Computer Science, University of Texas Rio Grande Valley, Edinburg, USA

PDF源文件 DOI 网页

197 天

Structural properties of subgroup magic rectangles

收稿 2025-10-31 录用 2026-05-16 发表 2026-07-18

作者S. Karthik; Aruna Venkatesan; Krishnan Paramasivam

作者单位1. Department of Mathematics, National Institute of Technology Calicut, Kozhikode, India

PDF源文件 DOI 网页

186 天

Interval-constrained bipartite matching over time

收稿 2025-12-12 录用 2026-06-16 发表 2026-07-11

作者Andreas Abels; Mariia Anapolska; Christina Büsing

作者单位1. Computer Science, Heinrich Heine Universität, Düsseldorf, Germany; 2. Combinatorial Optimization, RWTH Aachen, Aachen, Germany

PDF源文件 DOI 网页

211 天

Recoverable robust cardinality constrained maximization with commitment of a submodular function

收稿 2025-10-16 录用 2026-05-15 发表 2026-07-10

作者Sabine Münch; Stephen Raach; Sven de Vries

作者单位1. Trier University, Trier, Germany

PDF源文件 DOI 网页

290 天

Multi-points cyber defense ( \(1+\epsilon \) ) and \((1+\epsilon )^{k-k'}\) -approximation

收稿 2025-07-29 录用 2026-05-15 发表 2026-06-30

作者Pimukthee Jaikla; Sanpawat Kantabutra

作者单位1. The Theory of Computation Group, Department of Computer Engineering, Faculty of Engineering, Chiang Mai University, Chiang Mai, Thailand

PDF源文件 DOI 网页

528 天

CSB: A Counting and Sampling tool for Bit-vectors

收稿 2024-12-02 录用 2026-05-14 发表 2026-06-25

作者Arijit Shaw; Kuldeep S. Meel

作者单位1. Chennai Mathematical Institute, Chennai, India; 2. IAI, TCG-CREST, Kolkata, India; 3. Georgia Institute of Technology, Atlanta, USA; 4. University of Toronto, Toronto, Canada

PDF源文件 DOI 网页

192 天

A couple of simple algorithms for k -dispersion

收稿 2025-11-03 录用 2026-05-14 发表 2026-06-16

作者Ke Chen; Adrian Dumitrescu

作者单位1. Department of Computer Science and Engineering, The Pennsylvania State University, University Park, USA; 2. Algoresearch L.L.C., Milwaukee, USA; 3. Research Institute of the University of Bucharest, Bucharest, Romania; 4. Alfréd Rényi Institute of Mathematics, Budapest, Hungary

PDF源文件 DOI 网页

Expert Matching · Case Demo

把投稿要求，转成可验证的期刊方案

说清专业、时限和作者背景，CrushSCI 结合真实审稿样本，给出拟题方向、期刊初筛与周期判断。

客户询问

我是环境工程专业，需要一篇 SCI，希望 3 个月内见刊。没有基金，也没有大牛挂名，可以投哪些期刊？

CrushSCI回复

可以。先按 90 天时限做可行性筛选，同步查找无基金、无知名作者挂靠的典型论文案例，作为选刊依据。重点核对研究质量与期刊 scope。

拟题建议: 《融合机器学习与生命周期评价的城市污水处理碳排放预测与优化》
数据库初筛: Environmental Technology & Innovation

样本口径2026 年最近 5 篇有效论文样本

平均审稿96.4 天

中位数77 天

ACTA INFORMATICA

全部论文审稿周期

Practically-self-stabilizing vector clocks without scheduling fairness

Incremental–decremental maximization

Fast pattern matching with epsilon transitions

Tile-based knot assembly with Celtic!

Structural properties of subgroup magic rectangles

Interval-constrained bipartite matching over time

Recoverable robust cardinality constrained maximization with commitment of a submodular function

Multi-points cyber defense ( \(1+\epsilon \) ) and \((1+\epsilon )^{k-k'}\) -approximation

CSB: A Counting and Sampling tool for Bit-vectors

A couple of simple algorithms for k -dispersion

把投稿要求，转成可验证的期刊方案

联系 CrushSCI

扫码添加微信好友

正在维护

ACTA INFORMATICA

全部论文审稿周期

Practically-self-stabilizing vector clocks without scheduling fairness

Incremental–decremental maximization

Fast pattern matching with epsilon transitions

Tile-based knot assembly with Celtic!

Structural properties of subgroup magic rectangles

Interval-constrained bipartite matching over time

Recoverable robust cardinality constrained maximization with commitment of a submodular function

Multi-points cyber defense ( \(1+\epsilon \) ) and \((1+\epsilon )^{k-k'}\) -approximation

CSB: A Counting and Sampling tool for Bit-vectors

A couple of simple algorithms for k -dispersion

相关榜单与期刊入口