A note on constructing binary heaps with periodic networks.

DOI10.1016/S0020-0190(01)00320-9MaRDI QIDQ1853052zbMATH OpenOpenAlexFDO

Authors Marek Piotrów

Publication date 21 January 2003

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0190(01)00320-9

zbMATH Keywords

Parallel algorithmsData structuresBinary heapsComparatorsPeriodic networks

Mathematics Subject Classification ID

Data structures (68P05) Parallel algorithms in computer science (68W10)

Recommendations

• A note on constructing min-max heaps
• Periodification scheme: constructing sorting networks with constant period
• On the complexity of building an interval heap
• Bipartite binomial heaps
• A characterization of heaps and its applications
• On the random construction of heaps
• On the efficiency of pairing heaps and related data structures
• Comparator networks for binary heap construction

Cites work

• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Comparator networks for binary heap construction
• Heap construction in the parallel comparison tree model
• On the Number of Stable States in a NOR Network
• Periodic merging networks
• Sorting in \(c \log n\) parallel steps
• The periodic balanced sorting network

Cited in

(2)

• Comparator networks for binary heap construction
• Comparator networks for binary heap construction

Describes a project that uses

Uses Software

• heapsort

This page was built for publication: A note on constructing binary heaps with periodic networks.

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