http://worldcat.org/entity/work/id/2244706799

Heap construction in the parallel comparison tree model

Abstract: "I show how to put n values into heap order O(log log n) time using n/log log n processors in the parallel comparison tree model of computation, and in Õ([alpha](n)) time on n/[alpha](n) processors, in the randomized parallel comparison tree model, where [alpha](n) is an inverse of Ackerman's function. I prove similar bounds for the related problem of putting n values into a min-max heap."

Open All Close All