An algorithm for merging heaps

DOI10.1007/BF00264229zbMath0545.68027DBLPjournals/acta/SackS85OpenAlexW2518525525WikidataQ62037536 ScholiaQ62037536MaRDI QIDQ797280

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)

Related Items (6)

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

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