## Find a copy in the library

Finding libraries that hold this item...

## Details

Document Type: | Book |
---|---|

All Authors / Contributors: |
Paul Frederick Dietz |

OCLC Number: | 27864570 |

Notes: | "February 21, 1992." |

Description: | 10 pages ; 28 cm. |

Series Title: | University of Rochester.; Department of Computer Science.; Technical report |

Responsibility: | Paul F. Dietz. |

### Abstract:

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."

## Reviews

*User-contributed reviews*

Add a review and share your thoughts with other readers.
Be the first.

Add a review and share your thoughts with other readers.
Be the first.

## Tags

Add tags for "Heap construction in the parallel comparison tree model".
Be the first.