A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
The power of collision: Randomized parallel algorithms for chaining and integer sorting
[chapter]

1990
*
Lecture Notes in Computer Science
*

We address the problem of sorting n integers each in the range {l, ... ,m}, for m = nO(l), in parallel on the PRAM model of computation. We present a randomized algorithm that runs with very high probability in O(log njlog log n) time with a processor-time product of O(n loglogm) and O(n) space on the CRCW (COLLISION) PRAM [13] . The improvements that this algorithm makes over existing ones [5, 20, 27] include a weakening of the model of computation used and reducing the space requirement to

doi:10.1007/3-540-53487-3_42
fatcat:6bwpuzmkabbjtpizcr22g3qlbq