A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Deterministic coin tossing with applications to optimal parallel list ranking
1986
Information and Control
The following problem is considered: given a linked list of length n, compute the distance from each element of the linked list to the end of the list. The problem has two standard deterministic algorithms: a linear time serial algorithm, and an O(log n) time parallel algorithm using n processors. We present new deterministic parallel algorithms for the problem. Our strongest results are (1) O(logn log* n) time using n/(log n log* n) processors (this algorithm achieves optimal speed-up); (2)
doi:10.1016/s0019-9958(86)80023-7
fatcat:57lv3cvjevffxe6rhrjnhetn4m