Pairing heaps with costless meld
From MaRDI portal
Publication:3586394
Recommendations
Cited in
(12)- The pairing heap: A new form of self-adjusting heap
- Improved upper bounds for pairing heaps
- A survey on priority queues
- A linear potential function for pairing heaps
- On the efficiency of pairing heaps and related data structures
- Toward optimal self-adjusting heaps
- Pairing heaps with O( n) decrease cost
- Bipartite binomial heaps
- Pairing heaps: the forward variant
- Melding priority queues
- Rank-pairing heaps
- Rank-Pairing Heaps
This page was built for publication: Pairing heaps with costless meld
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3586394)