ISSN: 0022-0000

Journal Home

Journal Guideline

Journal of Computer and System Sciences Q1 Unclaimed

Academic Press Inc. United States

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

Journal of Computer and System Sciences is a journal indexed in SJR in Applied Mathematics and Computational Theory and Mathematics with an H index of 103. It has an SJR impact factor of 1,37 and it has a best quartile of Q1. It is published in English. It has an SJR impact factor of 1,37.

Type: Journal

Type of Copyright:

Languages: English

Open Access Policy:

Type of publications:

Publication frecuency: -

Categories: Applied Mathematics (Q1) Computational Theory and Mathematics (Q1) Computer Networks and Communications (Q1) Theoretical Computer Science (Q1)

Price

- €

Inmediate OA

NPD

Embargoed OA

- €

Non OA

Metrics

1,37

SJR Impact factor

103

H Index

50

Total Docs (Last Year)

188

Total Docs (3 years)

1869

Total Refs

349

Total Cites (3 years)

183

Citable Docs (3 years)

1.77

Cites/Doc (2 years)

37.38

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

Journal of the American Mathematical Society Q1
IEEE Transactions on Pattern Analysis and Machine Intelligence Q1
IEEE Transactions on Wireless Communications Q1
Molecular Systems Biology Q1
IEEE Signal Processing Magazine Q1

Compare this journals

Aims and Scope

Best articles by citations

Connection-trap-free database schemes

First-order spectra with one variable

Parallel construction of subdivision hierarchies

Distributed event algebras

Lower bounds on the length of universal traversal sequences

Discovery of optimal factors in binary data via a novel method of matrix decomposition

Practical arbitrary lookahead LR parsing

Lower bounds to randomized algorithms for graph properties

The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems

Bounds on the propagation of selection into logic programs

Matrix and matricial iteration theories, Part I

Matrix and matricial iteration theories, Part II

SHOW MORE ARTICLES

One-sided recursions

Soliton automata

Discrete-time versus continuous-time models of neural networks

Nonexpressibility of fairness and signaling

Editor's Foreword

Editor's foreword

An implicit data structure for searching a multikey table in logarithmic time