Comparator networks for binary heap construction

DOI10.1016/S0304-3975(99)00137-1zbMath0959.68033WikidataQ127330231 ScholiaQ127330231MaRDI QIDQ1589657

Gerth Stølting Brodal, Maria Cristina Pinotti

Publication date: 12 December 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

binary heaps

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (1)

A note on constructing binary heaps with periodic networks.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sorting in \(c \log n\) parallel steps
• Finding the median
• Time bounds for selection
• Finding the \(\alpha n\)-th largest element
• Median Selection Requires $(2+\epsilon)n$ Comparisons
• Selection Networks
• Lower Bounds on Merging Networks
• The asymptotic complexity of merging networks
• A Method of Constructing Selection Networks with $O(\log n)$ Depth
• Heap construction in the parallel comparison tree model

This page was built for publication: Comparator networks for binary heap construction