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.
Metrics
Scimago and CountryOfPapers database fields
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
—
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.
Researcher reviews
Best articles by citations
Acyclic orientations do not lead to optimal deadlock-free packet routing algorithms
View moreTransitive term graph rewriting
View moreAn optimal algorithm for computing the min-transitive closure of a weighted graph
View moreAn improvement on parallel computation of a maximal matching
View moreAn efficient nearest neighbor search in high-dimensional data spaces
View moreAn efficient external sorting algorithm
View moreAn asymptotic study of a recursion occurring in the analysis of an algorithm on broadcast communication
View moreAn approximation algorithm for least median of squares regression
View moreAn approximate binary search algorithm for the multiple-choice knapsack problem
View moreAn algorithm for dynamic data allocation in distributed systems
View moreAn algorithm for "Ulam's Game" and its application to error correcting codes
View moreAlgorithms for transitive closure
View moreAdding state merging to the DMC data compression algorithm
View moreA -approximation algorithm for metric Max TSP
View moreA simple algorithm for learning O(log n)-term DNF
View moreA polynomial bound on the number of light cycles in an undirected graph
View moreA note on the size of a multicast tree in hypercubes
View moreA note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points
View moreA note on neural sorting networks with O(1) time complexity
View moreA note on deflection worm routing on meshes
View moreA lower bound on Voronoi diagram complexity
View moreA lower bound for depth-3 circuits with MOD m gates
View moreA generalized grid quorum strategy for k-mutual exclusion in distributed systems
View moreA conservative scheme for parallel interval narrowing
View more