A characterization of heaps and its applications

DOI10.1016/0890-5401(90)90026-EzbMath0705.68043OpenAlexW2012012283WikidataQ62037515 ScholiaQ62037515MaRDI QIDQ918196

Jörg-Rüdiger Sack, Thomas Strothotte

Publication date: 1990

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(90)90026-e

zbMATH Keywords

heapalgorithm for mergingalgorithm for splitting

Mathematics Subject Classification ID

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

Related Items (4)

A note on the largest number of red nodes in red-black trees ⋮ Optimizing binary heaps ⋮ Two skew-binary numeral systems and one application ⋮ Multimode resource-constrained project scheduling in flexible projects

Uses Software

• heapsort

Cites Work

• Unnamed Item
• Unnamed Item
• An algorithm for merging heaps
• Implicit data structures for fast search and update
• Axioms and hulls
• Heaps on Heaps

This page was built for publication: A characterization of heaps and its applications