verified SJR 0,494 · Q2 • database Scopus / SJR & Web of Science indexed

Netherlands · Elsevier B.V.

workspace_premium Q2 — Computer Science (miscellaneous) lock Subscription Unclaimed

Theoretical Computer Science

Theoretical Computer Science is a journal indexed in SJR in Computer Science (miscellaneous) and Theoretical Computer Science with an H index of 133. It has an SJR impact factor of 0,494 and it has a best quartile of Q2. It is published in English. It has an SJR impact factor of 0,494.

Theoretical Computer Science focuses its scope in these topics and keywords: dynamic, approach, subwords, bounding, automation, entanglementthe, cascadesquantum, thresholdbased, input?cycles, deterministic, ...

ISSN: 0304-3975

Editorial: Elsevier B.V.

Category: Computer Science (miscellaneous)

Indexation: verifiedScopus / SJR verifiedWeb of Science

Unclaimed profile — some fields may be incomplete.

open_in_new Portal NPD menu_book Guidelines NPD

schedule Datos CoP · solo campos en BD

SJR Impact Factor trending_up

0,494 Q2

H-index 133

Tasa de Aceptación pie_chart

23% Selectiva

Fuente Acceptance_Rate

Tiempo a publicación hourglass_top

NPD

Campo Sin dato

Coste de Publicación (APC) payments

NPD Subscription

Ruta Non-OA NPD

Metrics

Campos Scimago / CoP — sin series inventadas

Scopus / SJR Web of Science

SJR Impact

0,494

H-index

133

Docs (year)

366

Docs 3y

1306

Total refs

11255

Cites 3y

1725

Citable 3y

1280

Cites/Doc 2y

1.32

Ref/Doc

30.75

Immediate OA

—

Embargoed OA

NPD

Non OA / Submission

—

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

Comparing models of the intensional typedlambda-calculus

Underspecification for a simple process algebra of recursive processes

Efficient enumeration of all minimal separators in a graph

Editorial

Dynamic scheduling of parallel computations

Dynamic and static algorithms for optimal placement of resources in a tree

Double Greibach operator grammars

Domain-independent queries on databases with external functions

Divergence in testing and readiness semantics

Deformation techniques to solve generalised Pham systems

Corrigendum to "On functions preserving levels of approximation: a refined model construction for various lambda calculi" [Theoret. Comput. Sci. 212 (1999) 261-303]

Computing in unpredictable environments: semantics, reduction strategies, and program transformations

SHOW MORE ARTICLES

Computational indistinguishability: Algorithms vs. circuits

A 32log 3-competitive algorithm for the counterfeit coin problem

Comparator networks for binary heap construction

Bubbles in modularity

Basic process algebra with deadlocking states

Asynchronous cellular automata for pomsets

Approximating uniform triangular meshes in polygons

Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order

Algebraic specification of reactive systems

A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics

A short proof of representability of fork algebras

A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem

FAQS

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