Rank-Pairing Heaps
From MaRDI portal
Recommendations
Cited in
(14)- Reflected min-Max heaps
- The pairing heap: A new form of self-adjusting heap
- Three priority queue applications revisited
- The weak-heap data structure: variants and applications
- Faster kinetic heaps and their use in broadcast scheduling. (Extended abstract)
- Soft heaps simplified
- A linear potential function for pairing heaps
- Pairing heaps, scrambled pairing and square-root trees
- The violation heap: a relaxed Fibonacci-like heap
- On the efficiency of pairing heaps and related data structures
- The violation heap: a relaxed Fibonacci-like heap
- scientific article; zbMATH DE number 2050887 (Why is no real title available?)
- A simpler implementation and analysis of Chazelle's soft heaps
- Rank-pairing heaps
This page was built for publication: Rank-Pairing Heaps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5902178)