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): |
---|---|
125 KBytes | |
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView |