提供学术论文选刊润色服务
计算机科学
计算机科学
Paper Review Records
全部论文审稿周期
14 篇有效样本 · 按发表日期由新到旧排列
审稿天数=录用日期-收稿日期；保留 PDF/DOI/网页源链接
313
天
Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams
作者Sepehr Assadi; Soheil Behnezhad; Christian Konrad; Kheeran Naidu; Janani Sundaresan
作者单位1. University of Waterloo Faculty of Mathematics; 2. Northeastern University - Boston Campus; 3. University of Bristol
535
天
535
天
On the Node-Averaged Complexity of Locally Checkable Problems on Trees
作者Alkida Balliu; Sebastian Brandt; Fabian Kuhn; Dennis Olivetti; Gustav Schmid
作者单位1. Gran Sasso Science Institute; 2. CISPA Helmholtz Center for Information Security; 3. Department of Computer Science, University of Freiburg; 4. University of Freiburg
528
天
538
天
556
天
Convergence of Approximate and Packet Routing Equilibria to Nash Flows Over Time
作者Neil Olver; Leon Sering; Laura Vargas Koch
作者单位1. Department of Mathematics, The London School of Economics and Political Science; 2. ETH Zurich; 3. School of Business and Economics, RWTH Aachen University
796
天
Quantitative Equational Logic
作者Giorgio Bacci; Radu Mardare; Prakash Panangaden; Gordon Plotkin
作者单位1. Department of Computer Science, AAU; 2. School of Mathematics and Computer Science, Heriot-Watt University; 3. School of Computer Science, McGill University; 4. School of Informatics, University
1,069
天
Robustly Learning Mixtures of k Arbitrary Gaussians
作者Ainesh Bakshi; Ilias Diakonikolas; He Jia; Daniel Kane; Pravesh Kothari; Santosh Vempala
作者单位1. Carnegie Mellon University; 2. New York University; 3. Computer Sciences, University of Wisconsin Madison; 4. Computer Science, Georgia Institute of Technology; 5. Northwestern University; 6. Computer Science and Engineering, University of California San Diego; 7. Princeton University
186
天
242
天
Vizing’s Theorem in Near-Linear Time
作者Sepehr Assadi; Soheil Behnezhad; Sayan Bhattacharya; Martin Costa; Shay Solomon; Tianyi Zhang
作者单位1. University of Waterloo; 2. Northeastern University; 3. University of Warwick; 4. Tel Aviv University; 5. State Key Laboratory for Novel Software Technology, Nanjing University
Expert Matching · Case Demo
把投稿要求，转成可验证的期刊方案
说清专业、时限和作者背景，CrushSCI 结合真实审稿样本，给出拟题方向、期刊初筛与周期判断。
客户询问
我是环境工程专业，需要一篇 SCI，希望 3 个月内见刊。没有基金，也没有大牛挂名，可以投哪些期刊？
CrushSCI回复
可以。先按 90 天时限做可行性筛选，同步查找无基金、无知名作者挂靠的典型论文案例，作为选刊依据。重点核对研究质量与期刊 scope。
- 拟题建议
- 《融合机器学习与生命周期评价的城市污水处理碳排放预测与优化》
样本口径2026 年最近 5 篇有效论文样本
平均审稿96.4 天
中位数77 天