The following pages link to An algorithm for merging heaps (Q797280):
Displaying 9 items.
- Range-restricted mergeable priority queues (Q689640) (← links)
- A characterization of heaps and its applications (Q918196) (← links)
- A pointer-free data structure for merging heaps and min-max heaps (Q1177934) (← links)
- A tree-based mergesort (Q1284695) (← links)
- The heap-mergesort (Q1568737) (← links)
- Efficient privacy-preserving data merging and skyline computation over multi-source encrypted data (Q2215086) (← links)
- A Survey on Priority Queues (Q2848973) (← links)
- Merging heaps in parallel (Q3989853) (← links)
- The K-D heap: An efficient multi-dimensional priority queue (Q5060123) (← links)