Comparator networks for binary heap construction

DOI10.1016/S0304-3975(99)00137-1zbMATH Open0959.68033WikidataQ127330231 ScholiaQ127330231MaRDI QIDQ1589657FDOQ1589657

Authors: Gerth Stølting Brodal, Maria Cristina Pinotti 

Publication date: 12 December 2000

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

Recommendations

• Comparator networks for binary heap construction
• A note on constructing binary heaps with periodic networks.
• scientific article; zbMATH DE number 742986
• Building heaps fast
• Heaps on Heaps

zbMATH Keywords

binary heaps

Mathematics Subject Classification ID

Data structures (68P05)

Cites Work

• Title not available (Why is that?)
• Sorting in \(c \log n\) parallel steps
• Time bounds for selection
• Median selection requires \((2+\varepsilon)n\) comparisons
• Finding the median
• The asymptotic complexity of merging networks
• Title not available (Why is that?)
• Lower Bounds on Merging Networks
• Title not available (Why is that?)
• Finding the \(\alpha n\)-th largest element
• Selection Networks
• A Method of Constructing Selection Networks with $O(\log n)$ Depth
• Heap construction in the parallel comparison tree model

Cited In (4)

• A note on constructing binary heaps with periodic networks.
• Comparator networks for binary heap construction
• Incremental encoding of pseudo-Boolean goal functions based on comparator networks
• Construction of halvers

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1589657)