Max-Planck-Institut für Informatik
max planck institut
informatik
mpii logo Minerva of the Max Planck Society
 

MPI-I-98-1-002

Comparator networks for binary heap construction

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

MPI-I-98-1-002. January 1998, 11 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry

Abstract in LaTeX format:
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.
Acknowledgement:
References to related material:

To download this research report, please select the type of document that fits best your needs.Attachement Size(s):
MPI-I-98-1-002.ps125 KBytes
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView
URL to this document: http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/1998-1-002

Hide details for BibTeXBibTeX
@TECHREPORT{BrodalPinotti98,
  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},
}