CrushSCI.com
415.5平均天数
356中位天数
42最短天数
798最长天数
652025发文量

Paper Review Records

全部论文审稿周期

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

42 天

Fault-Tolerant ST-Diameter Oracles

作者
Davide Bilò; Keerti Choudhary; Sarel Cohen; Tobias Friedrich; Simon Krogmann; Martin Schirneck展开收起
作者单位
1. Department of Information Engineering, Computer Science and Mathematics, University of L’Aquila, L’Aquila, Italy; 2. Department of Computer Science and Engineering, Indian Institute of Technology Delhi, Delhi, India; 3. Efi Arazi School of Computer Science, Reichman University, Herzliya, Israel; 4. Hasso Plattner Institute, University of Potsdam, Potsdam, Germany; 5. Derpartment of Informatics, Karlsruhe Institute of Technology, Karlsruhe, Germany展开收起
PDF源文件 DOI 网页
373 天

Segment Proximity Graphs and Nearest Neighbor Queries amid Disjoint Segments

作者
Pankaj K. Agarwal; Haim Kaplan; Matthew J. Katz; Micha Sharir展开收起
作者单位
1. Department of Computer Science, Duke University, Durham, USA; 2. School of Computer Science, Tel Aviv University, Tel Aviv, Israel; 3. The Stein Faculty of Computer and Information Science, Ben-Gurion University of the Negev, Beer Sheva, Israel展开收起
PDF源文件 DOI 网页
392 天

A Lower Bound on the Trace Norm of Boolean Matrices and its Applications

作者
Tsun-Ming Cheung; Hamed Hatami; Kaave Hosseini; Aleksandar Nikolov; Toniann Pitassi; Morgan Shirley展开收起
作者单位
1. Institute of Information Science, Academia Sinica, Taipei, Taiwan; 2. School of Computer Science, McGill University, Montreal, Canada; 3. Department of Computer Science, University of Rochester, Rochester, USA; 4. Department of Computer Science, University of Toronto, Toronto, Canada; 5. Department of Computer Science, Columbia University, New York, USA; 6. Department of Computer Science, Lund University, Lund, Sweden展开收起
PDF源文件 DOI 网页
199 天

A General Upper Bound for the Runtime of a Coevolutionary Algorithm on Impartial Combinatorial Games

作者
Alistair Benford; Per Kristian Lehre展开收起
作者单位
1. School of Informatics, University of Edinburgh, Edinburgh, UK; 2. School of Computer Science, University of Birmingham, Birmingham, UK展开收起
PDF源文件 DOI 网页
339 天

Tree-Packing Revisited: Faster Fully Dynamic Min-Cut and Arboricity

作者
Tijn de Vos; Aleksander Christiansen展开收起
作者单位
1. TU Graz, Graz, Austria; 2. Technical University of Denmark, Copenhagen, Denmark展开收起
PDF源文件 DOI 网页
736 天

Counting Polyominoes, Revisited

作者
Gill Barequet; Gil Ben-Shachar展开收起
作者单位
1. Department of Computer Science, The Technion—Israel Institute of Technology, Haifa, Israel展开收起
PDF源文件 DOI 网页

Expert Matching · Case Demo

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

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

我们会在半小时内回复。

CrushSCI 在线

客户询问

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

CrushSCI回复

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

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

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

平均审稿62 天

中位数65 天

Contact CrushSCI

联系 CrushSCI

留下手机号或微信号,我们将与你确认学术润色、结构优化或一对一辅导咨询需求。

我们会在半小时内回复。

当前选择:学术咨询服务

预留联系方式

也可以直接发送邮件至 [email protected]

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