On Parallel Hashing and Integer Sorting

On Parallel Hashing and Integer Sorting (1991)

by Yossi Matias , Uzi Vishkin

Citations:

24 - 9 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	On Parallel Hashing and Integer Sorting	user correction - Legacy Corrections
AUTHOR NAME	Yossi Matias	SVM HeaderParse 0.2
AUTHOR NAME	Uzi Vishkin	SVM HeaderParse 0.2
ABSTRACT	The problem of sorting n integers from a restricted range [1::m], where m is superpolynomial in n, is considered. An o(n log n) randomized algorithm is given. Our algorithm takes O(n log log m) expected time and O(n) space. (Thus, for m = n polylog(n) we have an O(n log log n) algorithm.) The algorithm is parallelizable. The resulting parallel algorithm achieves optimal speed up. Some features of the algorithm make us believe that it is relevant for practical applications. A result of independent interest is a parallel hashing technique. The expected construction time is logarithmic using an optimal number of processors, and searching for a value takes O(1) time in the worst case. This technique enables drastic reduction of space requirements for the price of using randomness. Applicability of the technique is demonstrated for the parallel sorting algorithm, and for some parallel string matching algorithms. The parallel sorting algorithm is designed for a strong and non standard mo...	user correction - Legacy Corrections
YEAR	1991	user correction - Legacy Corrections
CITATIONS	65 found	ParsCit 1.0