Comparator networks for binary heap construction

Brodal, Gerth Stølting; Pinotti, M. Cristina

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Report

Comparator networks for binary heap construction

MPS-Authors

/persons/resource/persons44187

Brodal, Gerth Stølting
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

MPI-I-98-1-002.pdf
(Any fulltext), 197KB

Supplementary Material (public)

There is no public supplementary material available

Citation

Brodal, G. S., & Pinotti, M. C.(1998). Comparator networks for binary heap construction (MPI-I-1998-1-002). Saarbrücken: Max-Planck-Institut für Informatik.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-9A0B-B

Abstract

Comparator networks for constructing binary heaps of size $n$ are presented which have size $O(n\log\log n)$ and depth $O(\log n)$. A lower bound of $n\log\log n-O(n)$ for the size of any heap construction network is also proven, implying that the networks presented are within a constant factor of optimal. We give a tight relation between the leading constants in the size of selection networks and in the size of heap constructiion networks.