MPI-INF/SWS Research Reports 1991-2021

2. Number - All Departments


Comparator networks for binary heap construction

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

January 1998, 11 pages.

Status: available - back from printing

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.

  • Attachement: ATTB5TVQ (125 KBytes)

URL to this document:

Hide details for BibTeXBibTeX
  AUTHOR = {Brodal, Gerth Stølting and Pinotti, M. Cristina},
  TITLE = {Comparator networks for binary heap construction},
  TYPE = {Research Report},
  INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
  ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
  NUMBER = {MPI-I-98-1-002},
  MONTH = {January},
  YEAR = {1998},
  ISSN = {0946-011X},