ISSN: 0304-3975

Journal Home

Journal Guideline

Theoretical Computer Science Q2 Unclaimed

Elsevier Netherlands

Unfortunately this journal has not been claimed yet. For this reason, some information may be unavailable.

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

Theoretical Computer Science focuses its scope in these topics and keywords: dynamic, paths, functiondistributed, induced, input?cycles, lattice, message, monopolies, networksreductions, optimal, ...

Type: Journal

Type of Copyright:

Languages: English

Open Access Policy:

Type of publications:

Publication frecuency: -

Categories: Computer Science (miscellaneous) (Q2) Theoretical Computer Science (Q2)

Price

- €

Inmediate OA

NPD

Embargoed OA

- €

Non OA

Metrics

0,59

SJR Impact factor

125

H Index

418

Total Docs (Last Year)

1544

Total Docs (3 years)

12052

Total Refs

2084

Total Cites (3 years)

1504

Citable Docs (3 years)

1.29

Cites/Doc (2 years)

28.83

Ref/Doc

Comments

No comments ... Be the first to comment!

Publication speed *

Review quality *

Edition and editorial team *

Institutional email or ORCID *

* The email or ORCID field is only to validate the authenticity of the comment, the identity will not be public. .

Other journals with similar parameters

ACM Transactions on Management Information Systems Q2
Computer Q2
Logical Methods in Computer Science Q2
Education Sciences Q2
Computational and Mathematical Organization Theory Q2

Compare this journals

Aims and Scope

Best articles by citations

Divergence in testing and readiness semantics

Editorial

Refinement and state machine abstraction

On the structure of minimum broadcast digraphs

New applications of the incompressibility method: Part II

Sparse and limited wavelength conversion in all-optical tree networks

On the parallel complexity of loops

On reachability equivalence for BPP-nets

A short proof of representability of fork algebras

A generalization of Naundorf's fixpoint theorem

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

Sturmian words: structure, combinatorics, and their arithmetics

SHOW MORE ARTICLES

On the walk

Theoretical aspects of coordination languages

Learning nested differences in the presence of malicious noise

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

Labelled trees and pairs of input-output permutations in priority queues

Domain-independent queries on databases with external functions

Dynamic scheduling of parallel computations

Monadic logic programs and functional complexity

Underspecification for a simple process algebra of recursive processes

Transformations that preserve malignness of universal distributions

New Curry-Howard terms for full linear logic