INFORMATION PROCESSING LETTERS

Edit Your Profile

INFORMATION PROCESSING LETTERS Journal

publication venue for

A note on minimizing the sum of quadratic completion times on two identical parallel machines. 112:738-742. 2012
2-Covered paths by a set of antennas with minimum power transmission range. 109:768-773. 2009
Minimal sensor integrity: Measuring the vulnerability of sensor grids. 86:49-55. 2003
The Bandwidth Allocation Problem in the ATM network model is NP-complete. 65:179-182. 1998
LINEAR-TIME CONSTRUCTION OF TREAPS AND CARTESIAN TREES. 52:253-257. 1994
ON THE COMPLEXITY OF BUILDING AN INTERVAL HEAP. 50:143-144. 1994
A NEW OPTIMAL DISTRIBUTED ALGORITHM FOR THE SET INTERSECTION PROBLEM. 38:143-148. 1991
MORE ON SHELLSORT INCREMENT SEQUENCES. 34:267-270. 1990
A NOTE ON THE HAMILTONIAN CIRCUIT PROBLEM ON DIRECTED PATH GRAPHS. 32:167-170. 1989
AN EFFICIENT DISTRIBUTED DEPTH-1ST-SEARCH ALGORITHM. 32:183-186. 1989
BAD CASES FOR SHAKER-SORT. 28:133-136. 1988
LINEAR-TIME CONSTRUCTION OF TREAPS AND CARTESIAN TREES (VOL 52, PG 253, 1994) 1995
Corrections to a distributed depth-first search algorithm. Information Processing Letters Vol. 32, No. 4 (1 September 1989) pp. 183-186 1990

category

COMPUTER SCIENCE, INFORMATION SYSTEMS Category

International Standard Serial Number (ISSN)

0020-0190

journal abbreviation

INFORM PROCESS LETT