ISSN: 0020-0190

Journal Home

Journal Guideline

Information Processing Letters Q3 Unclaimed

Elsevier B.V. Netherlands

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

Information Processing Letters is a journal indexed in SJR in Information Systems and Computer Science Applications with an H index of 86. It has an SJR impact factor of 0,412 and it has a best quartile of Q3. It is published in English. It has an SJR impact factor of 0,412.

Type: Journal

Type of Copyright:

Languages: English

Open Access Policy:

Type of publications:

Publication frecuency: -

Categories: Computer Science Applications (Q3) Information Systems (Q3) Signal Processing (Q3) Theoretical Computer Science (Q3)

Price

- €

Inmediate OA

NPD

Embargoed OA

- €

Non OA

Metrics

0,412

SJR Impact factor

86

H Index

63

Total Docs (Last Year)

230

Total Docs (3 years)

1184

Total Refs

209

Total Cites (3 years)

230

Citable Docs (3 years)

0.85

Cites/Doc (2 years)

18.79

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

Science of Computer Programming Q3
Cybernetics and Systems Q3
Journal of Systems Science and Systems Engineering Q3
INFOR: Information Systems and Operational Research Q3
INFOR Q3

Compare this journals

Aims and Scope

Best articles by citations

On the approximability of two tree drawing conventions

On approximating planar metrics by tree metrics

New statistics for demand-based software testing

A note on deflection worm routing on meshes

Separating collections of points in Euclidean spaces

Homogeneous grammars with a reduced number of non-context-free productions

A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points

plapackJava: Towards an efficient Java interface for high performance parallel linear algebra

Assessment of data redundancy in fuzzy relational databases based on semantic inclusion degree

An optimal algorithm for computing the min-transitive closure of a weighted graph

An algorithm for dynamic data allocation in distributed systems

Cyclic-cubes and wrap-around butterflies

SHOW MORE ARTICLES

Geometric two-server algorithms

An optimal algorithm for reporting visible rectangles

Optimal 1-fair alternators

Guarding in a simple polygon

Simple algorithms for searching a polygon with flashlights

Minimizing elimination tree height can increase fill more than linearly

Set constraints and topology

A polynomial bound on the number of light cycles in an undirected graph

Computing Euclidean bottleneck matchings in higher dimensions

On a hierarchy of languages generated by cooperating distributed grammar systems

Recognizing strict 2-threshold graphs in O(m) time

Scheduling complete intrees on two uniform processors with communication delays