verified SJR 0,414 · Q3 • database Scopus / SJR & Web of Science indexed

United States · Springer New York

workspace_premium Q3 — Computational Theory and Mathematics lock_open Open Access Unclaimed

Theory of Computing Systems

Theory of Computing Systems is a journal indexed in SJR in Computational Theory and Mathematics and Theoretical Computer Science with an H index of 49. It has a price of 2190 €. It has an SJR impact factor of 0,414 and it has a best quartile of Q3. It is published in English. It has an SJR impact factor of 0,414.

ISSN: 1432-4350

Editorial: Springer New York

Category: Computational Theory and Mathematics

Indexation: verifiedScopus / SJR verifiedWeb of Science

Unclaimed profile — some fields may be incomplete.

open_in_new Visitar Portal de la Editorial menu_book Guidelines NPD

schedule Datos CoP · solo campos en BD

SJR Impact Factor trending_up

0,414 Q3

H-index 49

Tasa de Aceptación pie_chart

32%

Fuente Acceptance_Rate

Tiempo a publicación hourglass_top

NPD

Campo Sin dato

Coste de Publicación (APC) payments

2.190 € Open Access

Ruta Non-OA 0 €

Metrics

Campos Scimago / CoP — sin series inventadas

Scopus / SJR Web of Science

SJR Impact

0,414

H-index

Docs (year)

Docs 3y

141

Total refs

1950

Cites 3y

113

Citable 3y

133

Cites/Doc 2y

0.54

Ref/Doc

31.97

Immediate OA

2190 €

Embargoed OA

NPD

Non OA / Submission

0 €

shield Researcher voice

Name good journals. Call out predatory ones.

Share what peer review, fees, and timelines were really like. Praise fair editors. Flag APC traps, fake metrics, or spam solicitations — with facts from your submission.

Fair & fast peer review Clear APC / no surprise fees Suspected predatory Fake impact claims

rate_review Write an honest review

Researcher reviews

sentiment_dissatisfied No reviews yet — be the first to share an honest experience.

Publication speed *

Review quality *

Edition and editorial team *

Institutional email or ORCID * * Only to validate authenticity — identity is not shown publicly.

Best articles by citations

Asymmetric Communication Protocols via Hotlink Assignments

Two Sources Are Better than One for Increasing the Kolmogorov Complexity of Infinite Sequences

Complete Classifications for the Communication Complexity of Regular Languages

Comparing Verboseness for Finite Automata and Turing Machines

Communication-Efficient Broadcasting in Complete Networks with Dynamic Faults

Characterizing the Micronuclear Gene Patterns in Ciliates

Broadcasting Spanning Forests on a Multiple-Access Channel

Black-Box Correctness Tests for Basic Parallel Data Structures

Axiomatising Tree-Interpretable Structures

Avoiding Routing Loops on the Internet

Average-Case Analysis of Greedy Packet Scheduling

Automatable Verification of Sequential Consistency

SHOW MORE ARTICLES

Attack Propagation in Networks

\bf DCAS-Based Concurrent Deques

Arithmetic Complexity, Kleene Closure, and Formal Power Series

Approximation Algorithms for Data Management in Networks

Approximately Counting Approximately-Shortest Paths in Directed Acyclic Graphs

Algebraic Results on Quantum Automata

Active Context-Free Games

Accepting Networks of Evolutionary Processors with Subregular Filters

A Simple Optimal Solution for the Temporal Precedence Problem on Pure Pointer Machines

A Note on Square Rooting of Time Functions of Turing Machines

A Note on Non-Deterministic Communication Complexity with Few Witnesses

A Note on MODp - MODm Circuits

FAQS

In Country of Papers you can find SJR impact factor and other metrics to help you decide on a Journal.