CrushSCI.com
Journal Selection & Manuscript Polishing Services
THEORY OF COMPUTING SYSTEMS journal cover Computer Science
Back to journal directory

Review Cycle Records

THEORY OF COMPUTING SYSTEMS

Springer SCIE Non-OA
2026 Emerging Zone 42025 CAS Zone 42025 JCR Q4
442.9Average days
232Median days
133Fastest days
1,587Longest days
392025 publications

Paper Review Records

All Paper Review Records

17 valid samples · Newest publication first
Review days = acceptance date − received date. PDF, DOI, and publisher-page sources are retained.

173 days

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

AuthorsAngshul Majumdar

Affiliations1. ECE, IIIT Delhi, Delhi, India

Source PDF DOI Publisher page
469 days

Suffixient Arrays: A New Efficient Suffix Array Compression Technique

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

Affiliations1. 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

Source PDF DOI Publisher page
245 days

Efficient Algorithms to Compute Closed Substrings

AuthorsSamkith K Jain; Neerja Mhaskar

Affiliations1. Department of Computing and Software, McMaster University, Hamilton, Canada

Source PDF DOI Publisher page
513 days

Searching in Euclidean Spaces with Predictions

AuthorsSergio Cabello; Panos Giannopoulos

Affiliations1. 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

Source PDF DOI Publisher page
1,587 days

Fast Algorithms for a Large-Scale File Aggregation Problem

AuthorsLifeng Guo; Changhong Lu; Qingjie Ye

Affiliations1. 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

Source PDF DOI Publisher page
133 days

Complexity Classes for Online Problems with and without Predictions

AuthorsMagnus Berg; Joan Boyar; Lene M. Favrholdt; Kim S. Larsen

Affiliations1. IBA International Business Academy, Kolding, Denmark; 2. Department of Mathematics and Computer Science, University of Southern Denmark, Odense M, Denmark

Source PDF DOI Publisher page
232 days

Search Versus Search for Collapsing Electoral Control Types

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

Affiliations1. 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

Source PDF DOI Publisher page
225 days

Parameterized Complexity of Generalizations of Edge Dominating Set

AuthorsShubhada Aute; Fahad Panolan; Souvik Saha; Saket Saurabh; Anannya Upasana

Affiliations1. 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

Source PDF DOI Publisher page
179 days

Multiplication of 0-1 Matrices via Clustering

AuthorsJesper Jansson; Miroslaw Kowaluk; Andrzej Lingas; Mia Persson

Affiliations1. 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

Source PDF DOI Publisher page
230 days

Accelerating Stage 2 in ECM Using Elliptic Divisibility Sequences

AuthorsZiwen Liao; Fangguo Zhang

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

Source PDF DOI Publisher page

Expert Matching · Case Demo

Turn Your Submission Goalsinto a Verifiable Journal Plan

Share your field, deadline, and author profile. CrushSCI uses real review records to suggest a title direction, shortlist journals, and estimate timelines.

CrushSCI online

Client

I work in environmental engineering and need an SCI paper published within three months. I have no grant funding or prominent co-author. Which journals could I target?

CrushSCI

Yes. We will first screen for feasibility against the 90-day deadline, then identify comparable papers without grant support or prominent co-authors. The final shortlist will prioritize research quality and journal scope.

Suggested title
Machine Learning and Life-Cycle Assessment for Predicting and Optimizing Carbon Emissions in Urban Wastewater Treatment

SampleLatest 5 valid paper samples from 2026

Average review96.4 days

Median77 days

Contact CrushSCI

Contact CrushSCI

Leave your contact details so we can discuss your manuscript, editing needs, and submission plan.

Selected service: Paper Editing Service

Or leave your contact details

WhatsApp, Telegram, WeChat, and email are all optional, but at least one is required. Once received, we will contact you as soon as possible.