Information Processing Letters

0.6(top 50%)

impact factor

7.8K(top 2%)

papers

125.4K(top 5%)

citations

119(top 5%)

h-index

0.6(top 50%)

impact factor

8.6K

all documents

133.8K

doc citations

206(top 5%)

g-index

Top Articles

#	Title	Journal	Year	Citations
1	The particle swarm optimization algorithm: convergence analysis and parameter selection	Information Processing Letters	2003	2,320
2	An algorithm for drawing general undirected graphs	Information Processing Letters	1989	2,033
3	An efficient algorith for determining the convex hull of a finite planar set	Information Processing Letters	1972	1,329
4	Defining liveness	Information Processing Letters	1985	811
5	The budgeted maximum coverage problem	Information Processing Letters	1999	757
6	Occam's Razor	Information Processing Letters	1987	748
7	A linear-time algorithm for testing the truth of certain quantified boolean formulas	Information Processing Letters	1979	676
8	Constructing optimal binary decision trees is NP-complete	Information Processing Letters	1976	673
9	Dynamic program slicing	Information Processing Letters	1988	615
10	A calculus of durations	Information Processing Letters	1991	597
11	On generating all maximal independent sets	Information Processing Letters	1988	583
12	Termination detection for diffusing computations	Information Processing Letters	1980	574
13	Optimal packing and covering in the plane are NP-complete	Information Processing Letters	1981	550
14	On the identification of the convex hull of a finite set of points in the plane	Information Processing Letters	1973	530
15	Satisfying general proximity / similarity queries with metric trees	Information Processing Letters	1991	514
16	An attack on the Needham-Schroeder public-key authentication protocol	Information Processing Letters	1995	468
17	A guided tour of chernoff bounds	Information Processing Letters	1990	437
18	Myths about the mutual exclusion problem	Information Processing Letters	1981	419
19	Stochastic convergence analysis and parameter selection of the standard particle swarm optimization algorithm	Information Processing Letters	2007	401
20	A clustering algorithm based on graph connectivity	Information Processing Letters	2000	397
21	A lower bound for the time to assure interactive consistency	Information Processing Letters	1982	392
22	Application of a stochastic name-passing calculus to representation and simulation of molecular processes	Information Processing Letters	2001	361
23	Particle swarm optimization-based algorithms for TSP and generalized TSP	Information Processing Letters	2007	349
24	Preserving order in a forest in less than logarithmic time and linear space	Information Processing Letters	1977	346
25	Another efficient algorithm for convex hulls in two dimensions	Information Processing Letters	1979	335
26	The tree-to-tree editing problem	Information Processing Letters	1977	333
27	A note on preemptive scheduling of periodic, real-time tasks	Information Processing Letters	1980	323
28	Fixed-parameter tractability of graph modification problems for hereditary properties	Information Processing Letters	1996	314
29	An optimal algorithm for computing the repetitions in a word	Information Processing Letters	1981	312
30	A faster approximation algorithm for the Steiner problem in graphs	Information Processing Letters	1988	308
31	An improved GA and a novel PSO-GA-based hybrid algorithm	Information Processing Letters	2005	306
32	The Steiner problem with edge lengths 1 and 2	Information Processing Letters	1989	305
33	A probabilistic remark on algebraic program testing	Information Processing Letters	1978	301
34	Limits for automatic verification of finite-state concurrent systems	Information Processing Letters	1986	299
35	Improved artificial bee colony algorithm for global optimization	Information Processing Letters	2011	296
36	On computing a conditional edge-connectivity of a graph	Information Processing Letters	1988	292
37	Does co-NP have short interactive proofs?	Information Processing Letters	1987	290
38	Optimal speedup of Las Vegas algorithms	Information Processing Letters	1993	286
39	Steiner tree problem with minimum number of Steiner points and bounded edge-length	Information Processing Letters	1999	268
40	On computing the determinant in small parallel time using a small number of processors	Information Processing Letters	1984	267
41	Deciding the winner in parity games is in UP ∩ co-UP	Information Processing Letters	1998	266
42	Derivation of a termination detection algorithm for distributed computations	Information Processing Letters	1983	265
43	PDL with data constants	Information Processing Letters	1985	264
44	Decomposable searching problems	Information Processing Letters	1979	262
45	Triangulating a simple polygon	Information Processing Letters	1978	259
46	Finding good approximate vertex and edge partitions is NP-hard	Information Processing Letters	1992	258
47	On the editing distance between unordered labeled trees	Information Processing Letters	1992	257
48	Depth-first search is inherently sequential	Information Processing Letters	1985	250
49	Log-logarithmic worst-case range queries are possible in space Θ(N)	Information Processing Letters	1983	240
50	Constructing the visibility graph for n-line segments in O(n2) time	Information Processing Letters	1985	238

Scientometrics

Overviews

Citing Bodies

Information Processing Letters

Top Articles