An algorithm for merging heaps

DOI10.1007/BF00264229MaRDI QIDQ797280zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Thomas Strothotte, Jörg-Rüdiger Sack

Publication date 1985

Published in Acta Informatica (Search for Journal in Brave)

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

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)

Recommendations

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

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 tree-based mergesort
• A pointer-free data structure for merging heaps and min-max heaps
• The heap-mergesort
• A survey on priority queues
• 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)