ISSN: 0020-0190
Journal Home
Journal Guideline
Information Processing Letters Q3 Unclaimed
Information Processing Letters is a journal indexed in SJR in Information Systems and Computer Science Applications with an H index of 83. It has an SJR impact factor of 0,404 and it has a best quartile of Q3. It is published in English. It has an SJR impact factor of 0,404.
Type: Journal
Type of Copyright:
Languages: English
Open Access Policy:
Type of publications:
Publication frecuency: -
![Scopus Scopus](https://countryofpapers.com/img/indexedin/logo_sjr_bw.png)
![WOS WOS](https://countryofpapers.com/img/indexedin/jcr_bw.png)
- €
Inmediate OANPD
Embargoed OA- €
Non OAMetrics
0,404
SJR Impact factor83
H Index80
Total Docs (Last Year)234
Total Docs (3 years)1425
Total Refs213
Total Cites (3 years)234
Citable Docs (3 years)0.92
Cites/Doc (2 years)17.81
Ref/DocOther journals with similar parameters
Journal of Intelligent Systems Q3
International Journal of Innovative Computing, Information and Control Q3
International Journal of Parallel Programming Q3
Applied Computing and Informatics Q3
Problems of Information Transmission Q3
Compare this journals
Aims and Scope
Best articles by citations
On the approximability of two tree drawing conventions
View moreOn approximating planar metrics by tree metrics
View moreNew statistics for demand-based software testing
View moreA note on deflection worm routing on meshes
View moreSeparating collections of points in Euclidean spaces
View moreHomogeneous grammars with a reduced number of non-context-free productions
View moreA note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points
View moreplapackJava: Towards an efficient Java interface for high performance parallel linear algebra
View moreAssessment of data redundancy in fuzzy relational databases based on semantic inclusion degree
View moreAn optimal algorithm for computing the min-transitive closure of a weighted graph
View moreAn algorithm for dynamic data allocation in distributed systems
View moreCyclic-cubes and wrap-around butterflies
View moreGeometric two-server algorithms
View moreAn optimal algorithm for reporting visible rectangles
View moreOptimal 1-fair alternators
View moreGuarding in a simple polygon
View moreSimple algorithms for searching a polygon with flashlights
View moreMinimizing elimination tree height can increase fill more than linearly
View moreSet constraints and topology
View moreA polynomial bound on the number of light cycles in an undirected graph
View moreComputing Euclidean bottleneck matchings in higher dimensions
View moreOn a hierarchy of languages generated by cooperating distributed grammar systems
View moreRecognizing strict 2-threshold graphs in O(m) time
View moreScheduling complete intrees on two uniform processors with communication delays
View more
Comments