Parallel algorithms for the maximum and the median almost surely in constant time (1982)

by N Megiddo
Results 1 - 1 of 1

A linear-work parallel algorithm for finding . . .

by Richard Cole, Philip N. Klein, Robert E. Tarjan , 1994
"... We give the first linear-work parallel algorithm for finding a minimum spanning tree. It is a randomized algorithm, and requires O(2log \Lambda n log n) expected time. It is a modification of the sequential linear-time algorithm of Klein and Tarjan. ..."
Abstract - Cited by 13 (1 self) - Add to MetaCart
We give the first linear-work parallel algorithm for finding a minimum spanning tree. It is a randomized algorithm, and requires O(2log \Lambda n log n) expected time. It is a modification of the sequential linear-time algorithm of Klein and Tarjan.