Default: Theoretical Computer Science

ISSN: 0304-3975

Journal Home

Journal Guideline

Theoretical Computer Science Q2 Unclaimed

Elsevier B.V. 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 130. It has an SJR impact factor of 0,57 and it has a best quartile of Q2. It is published in English. It has an SJR impact factor of 0,57.

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

Type: Journal

Type of Copyright:

Languages: English

Open Access Policy:

Type of publications:

Publication frecuency: -


- €

Inmediate OA


Embargoed OA

- €

Non OA


Theoretical Computer Science


SJR Impact factor


H Index


Total Docs (Last Year)


Total Docs (3 years)


Total Refs


Total Cites (3 years)


Citable Docs (3 years)


Cites/Doc (2 years)




No comments ... Be the first to comment!

Aims and Scope

dynamic, paths, optimization, optimal, networksreductions, monopolies, message, lattice, input?cycles, problem, problems, smallest, sizes, sets, resource, related, register, recognizing, recoding, induced, graphs, functiondistributed, entanglementthe, bisimulationselforganizing, bounding, branching, cascadesquantum, changenextpreserving, community, complexity, computing, convergent, detection, deterministic, discoveryan, endoscopyextraction, finite, flows,

Best articles by citations

Divergence in testing and readiness semantics

View more


View more

Refinement and state machine abstraction

View more

On the structure of minimum broadcast digraphs

View more

New applications of the incompressibility method: Part II

View more

Sparse and limited wavelength conversion in all-optical tree networks

View more

On the parallel complexity of loops

View more

On reachability equivalence for BPP-nets

View more

A short proof of representability of fork algebras

View more

A generalization of Naundorf's fixpoint theorem

View more

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

View more

Sturmian words: structure, combinatorics, and their arithmetics

View more

On the walk

View more

Theoretical aspects of coordination languages

View more

Learning nested differences in the presence of malicious noise

View more

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

View more

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

View more

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

View more

Domain-independent queries on databases with external functions

View more

Dynamic scheduling of parallel computations

View more

Monadic logic programs and functional complexity

View more

Underspecification for a simple process algebra of recursive processes

View more

Transformations that preserve malignness of universal distributions

View more

New Curry-Howard terms for full linear logic

View more