An algorithm for merging heaps

DOI10.1007/BF00264229zbMATH Open0545.68027DBLPjournals/acta/SackS85OpenAlexW2518525525WikidataQ62037536 ScholiaQ62037536MaRDI QIDQ797280FDOQ797280

Jörg-Rüdiger Sack, Thomas Strothotte

Publication date: 1985

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00264229

Recommendations

• Merging heaps in parallel
• A Note on HEAPSORT
• scientific article
• A characterization of heaps and its applications
• Range-restricted mergeable priority queues

zbMATH Keywords

priority queuesmergingheaps

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cited In (9)

• Range-restricted mergeable priority queues
• Efficient privacy-preserving data merging and skyline computation over multi-source encrypted data
• The K-D heap: An efficient multi-dimensional priority queue
• A characterization of heaps and its applications
• A Survey on Priority Queues
• A tree-based mergesort
• A pointer-free data structure for merging heaps and min-max heaps
• The heap-mergesort
• Merging heaps in parallel

This page was built for publication: An algorithm for merging heaps

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