CrushSCI.com
提供学术论文选刊润色服务
INFORMATION PROCESSING LETTERS 期刊封面 计算机科学
返回期刊列表

Review Cycle Records

INFORMATION PROCESSING LETTERS

Elsevier SCIE 非OA
2026新锐 4区2025中科院 4区2025 JCR Q4
272.6平均天数
307中位天数
106最短天数
406最长天数
632025发文量

Paper Review Records

全部论文审稿周期

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

239 天

Longest common subsequence including at most k segments

作者Tiantian Li; Haitao Jiang; Xuefeng Cui; Haodi Feng; Daming Zhu; Lusheng Wang

作者单位School of Software, Shandong University, Jinan, Shandong, China; School of Computer Science and Technology, Shandong University, Qingdao, Shandong, China; Department of Computer Science, City University of Hong Kong, Hongkong, China

PDF源文件 DOI 网页
307 天

Reachability in graphs having linear 2-arboricity two is NL-hard

作者Ronak Bhadra; Raghunath Tewari

作者单位Indian Institute of Technology Kanpur, Kanpur, 208016, Uttar Pradesh, India

PDF源文件 DOI 网页
349 天

Practical committing attacks against Rocca-S

作者Ryunosuke Takeuchi; Yosuke Todo; Tetsu Iwata

作者单位Nagoya University, Furo-cho, Chikusa-ku, Nagoya 464-8603, Japan; NTT Social Informatics Laboratories, 3-9-11 Midori-cho, Musashino 180-8585, Japan

PDF源文件 DOI 网页
319 天

The Steiner path aggregation problem

作者Da Qi Chen; Daniel Hathcock; D. Ellis Hershkowitz; R. Ravi

作者单位University of Virginia, Charlottesville, 22904, VA, USA; Carnegie Mellon University, 5000 Forbes Ave, Pittsburgh, 15213, PA, USA; Brown University, Providence, 02912, RI, USA

PDF源文件 DOI 网页
362 天

The harmonious coloring game

作者Cláudia Linhares Sales; Thiago Marcilon; Nicolas Martins; Nicolas Nisse; Rudini Sampaio

作者单位Dept. Computação, Universidade Federal do Ceará, Brazil; Centro de Ciências e Tecnologia, Universidade Federal do Cariri, Brazil; Inst. Engenharia e Desenvolv. Sustentável, UNILAB, Brazil; Université Côte d'Azur, INRIA, CNRS, I3S, France

PDF源文件 DOI 网页
129 天

Note on pancake sorting

作者Marcin Peczarski

作者单位Institute of Informatics, University of Warsaw, ul. Banacha 2, PL-02-097 Warszawa, Poland

PDF源文件 DOI 网页
149 天

Tighter bounds on non-clairvoyant parallel machine scheduling with prediction to minimize makespan

作者Tianqi Chen; Zhiyi Tan

作者单位School of Mathematical Science, Zhejiang University, Hangzhou 310027, PR China

PDF源文件 DOI 网页
406 天

Logical characterization of branching bisimilarity over random processes

作者Xian Xu; Wenbo Zhang

作者单位East China University of Science and Technology, Shanghai, China; Shanghai Ocean University, Shanghai, China

PDF源文件 DOI 网页
106 天

Notes about the linear complexity of quaternary cyclotomic sequences of order four

作者Vladimir Edemskiy; Zeyu Cao

作者单位Yaroslav-the-Wise Novgorod State University, Department of Applied Mathematics and Informatics, B. St. Petersburgskaya, 41, Veliky Novgorod, 173003, Russia

PDF源文件 DOI 网页
343 天

Finding the cyclic covers of a string

作者Roberto Grossi; Costas S. Iliopoulos; Jesper Jansson; Zara Lim; Wing-Kin Sung; Wiktor Zuba

作者单位Dipartimento di Informatica, Università di Pisa, Italy; Department of Informatics, King's College London, UK; Graduate School of Informatics, Kyoto University, Kyoto, Japan; The Chinese University of Hong Kong, Hong Kong, China; Hong Kong Genome Institute, Hong Kong Science Park, Hong Kong, China; Centrum Wiskunde & Informatica, Amsterdam, the Netherlands

PDF源文件 DOI 网页

Expert Matching · Case Demo

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

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

CrushSCI 在线

客户询问

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

CrushSCI回复

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

拟题建议
《融合机器学习与生命周期评价的城市污水处理碳排放预测与优化》

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

平均审稿96.4 天

中位数77 天

Contact CrushSCI

联系 CrushSCI

扫码添加微信,或留下手机号/微信号,我们将与你确认稿件阶段、编辑需求和投稿计划。

当前选择:论文编辑服务

也可以预留联系方式

手机号和微信号至少填写一项,仅用于本次咨询联系,不会公开。