skip to content
Heap construction in the parallel comparison tree model Preview this item
ClosePreview this item
Checking...

Heap construction in the parallel comparison tree model

Author: Paul Frederick Dietz
Publisher: Rochester, N.Y. : University of Rochester, Dept. of Computer Science, [1992]
Series: University of Rochester.; Department of Computer Science.; Technical report
Edition/Format:   Book : English
Database:WorldCat
Summary:
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."
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; 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
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/27864570>
library:oclcnum"27864570"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/27864570>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:creator
schema:datePublished"1992"
schema:description"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.""@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/30272739>
schema:inLanguage"en"
schema:name"Heap construction in the parallel comparison tree model"@en
schema:publisher
schema:url

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.