CrushSCI.com
提供学术论文选刊润色服务
THEORY OF COMPUTING SYSTEMS 期刊封面 计算机科学
返回期刊列表

Review Cycle Records

THEORY OF COMPUTING SYSTEMS

Springer SCIE 非OA
2026新锐 4区2025中科院 4区2025 JCR Q4
442.9平均天数
232中位天数
133最短天数
1,587最长天数
392025发文量

Paper Review Records

全部论文审稿周期

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

173 天

Constrained Nonnegative Gram Feasibility is \(\exists \mathbb {R}\) -Complete

作者Angshul Majumdar

作者单位1. ECE, IIIT Delhi, Delhi, India

PDF源文件 DOI 网页
469 天

Suffixient Arrays: A New Efficient Suffix Array Compression Technique

作者Davide Cenzato; Lore Depuydt; Travis Gagie; Sung-Hwan Kim; Giovanni Manzini; Francisco Olivares; Nicola Prezza

作者单位1. DAIS, Ca’ Foscari University of Venice, Venice, Italy; 2. Department of Information Technology - IDLab, Ghent University - imec, Ghent, Belgium; 3. Faculty of Computer Science, Dalhousie University, Halifax, Canada; 4. Sant’Anna School of Advanced Studies, Pisa, Italy; 5. Computer Science Dept., University of Pisa, Pisa, Italy; 6. Department of Computer Science, University of Chile, Santiago, Chile; 7. CeBiB — Centre for Biotechnology and Bioengineering, Santiago, Chile

PDF源文件 DOI 网页
245 天

Efficient Algorithms to Compute Closed Substrings

作者Samkith K Jain; Neerja Mhaskar

作者单位1. Department of Computing and Software, McMaster University, Hamilton, Canada

PDF源文件 DOI 网页
513 天

Searching in Euclidean Spaces with Predictions

作者Sergio Cabello; Panos Giannopoulos

作者单位1. Faculty of Mathematics and Physics, University of Ljubljana, Ljubljana, Slovenia; 2. Institute of Mathematics, Physics and Mechanics, Ljubljana, Slovenia; 3. Department of Computer Science, City St. George’s, University of London, London, UK

PDF源文件 DOI 网页
1,587 天

Fast Algorithms for a Large-Scale File Aggregation Problem

作者Lifeng Guo; Changhong Lu; Qingjie Ye

作者单位1. School of Mathematical Sciences, Key Laboratory of MEA (Ministry of Education), Shanghai Key Laboratory of PMMP, and Nantong Institute for Applied Mathematics and Artificial Intelligence, East China Normal University, Shanghai, China

PDF源文件 DOI 网页
133 天

Complexity Classes for Online Problems with and without Predictions

作者Magnus Berg; Joan Boyar; Lene M. Favrholdt; Kim S. Larsen

作者单位1. IBA International Business Academy, Kolding, Denmark; 2. Department of Mathematics and Computer Science, University of Southern Denmark, Odense M, Denmark

PDF源文件 DOI 网页
232 天

Search Versus Search for Collapsing Electoral Control Types

作者Benjamin Carleton; Michael C. Chavrimootoo; Lane A. Hemaspaandra; David E. Narváez; Conor Taliancich; Henry B. Welles

作者单位1. Department of Computer Science, Cornell University, Ithaca, USA; 2. Department of Computer Science, Denison University, Granville, USA; 3. Department of Computer Science, University of Rochester, Rochester, USA; 4. Faculty of Mathematics and Physics, University of Ljubljana, Ljubljana, Slovenia; 5. Property Matrix, Culver City, USA

PDF源文件 DOI 网页
225 天

Parameterized Complexity of Generalizations of Edge Dominating Set

作者Shubhada Aute; Fahad Panolan; Souvik Saha; Saket Saurabh; Anannya Upasana

作者单位1. Department of Computer Science and Engineering, IIT Hyderabad, Hyderabad, India; 2. School of Computer Science, University of Leeds, Leeds, UK; 3. The Institute of Mathematical Sciences, HBNI, Chennai, India

PDF源文件 DOI 网页
179 天

Multiplication of 0-1 Matrices via Clustering

作者Jesper Jansson; Miroslaw Kowaluk; Andrzej Lingas; Mia Persson

作者单位1. Graduate School of Informatics, Kyoto University, Kyoto, Japan; 2. Institute of Informatics, University of Warsaw, Warsaw, Poland; 3. Department of Computer Science, Lund University, Lund, Sweden; 4. Department of Computer Science and Media Technology, Malmö University, Malmö, Sweden

PDF源文件 DOI 网页
230 天

Accelerating Stage 2 in ECM Using Elliptic Divisibility Sequences

作者Ziwen Liao; Fangguo Zhang

作者单位1. School of Computer Science and Engineering, Sun Yat-sen University, Guangzhou, China; 2. Guangdong Provincial Key Laboratory of Information Security Technology, Guangzhou, China

PDF源文件 DOI 网页

Expert Matching · Case Demo

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

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

CrushSCI 在线

客户询问

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

CrushSCI回复

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

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

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

平均审稿96.4 天

中位数77 天

Contact CrushSCI

联系 CrushSCI

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

当前选择:论文编辑服务

也可以预留联系方式

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