Journal list Promote Sponsor
verified SJR 0,412 · Q3 • database Scopus / SJR & Web of Science indexed
Information Processing Letters
Netherlands · Elsevier B.V.
workspace_premium Q3 — Information Systems lock Subscription

Information Processing Letters

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.

ISSN: 0020-0190
Publisher: Elsevier B.V.
Category: Information Systems
Indexation: verifiedScopus / SJR verifiedWeb of Science
open_in_new Portal NPD menu_book Guidelines NPD
schedule CountryOfPapers database fields
SJR Impact Factor trending_up
0,412 Q3
H-index 86
Acceptance rate pie_chart
26% Selective
Source Acceptance_Rate
Time to publication hourglass_top
NPD
Field NPD
Publication cost (APC) payments
NPD Subscription
Non-OA path NPD

Metrics

Scimago and CountryOfPapers database fields

Scopus / SJR Web of Science

SJR Impact

0,412

H-index

86

Docs (year)

63

Docs 3y

230

Total refs

1184

Cites 3y

209

Citable 3y

230

Cites/Doc 2y

0.85

Ref/Doc

18.79

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.
User
* Only to validate authenticity — identity is not shown publicly.

Best articles by citations

Acyclic orientations do not lead to optimal deadlock-free packet routing algorithms

View more

Transitive term graph rewriting

View more

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

View more

An improvement on parallel computation of a maximal matching

View more

An efficient nearest neighbor search in high-dimensional data spaces

View more

An efficient external sorting algorithm

View more

An asymptotic study of a recursion occurring in the analysis of an algorithm on broadcast communication

View more

An approximation algorithm for least median of squares regression

View more

An approximate binary search algorithm for the multiple-choice knapsack problem

View more

An algorithm for dynamic data allocation in distributed systems

View more

An algorithm for "Ulam's Game" and its application to error correcting codes

View more

Algorithms for transitive closure

View more
SHOW MORE ARTICLES

Adding state merging to the DMC data compression algorithm

View more

A -approximation algorithm for metric Max TSP

View more

A simple algorithm for learning O(log n)-term DNF

View more

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

View more

A note on the size of a multicast tree in hypercubes

View more

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

View more

A note on neural sorting networks with O(1) time complexity

View more

A note on deflection worm routing on meshes

View more

A lower bound on Voronoi diagram complexity

View more

A lower bound for depth-3 circuits with MOD m gates

View more

A generalized grid quorum strategy for k-mutual exclusion in distributed systems

View more

A conservative scheme for parallel interval narrowing

View more

FAQs