Pairing heaps: the forward variant
From MaRDI portal
Recommendations
Cites work
- A Back-to-Basics Empirical Study of Priority Queues
- A data structure for manipulating priority queues
- A linear potential function for pairing heaps
- A practical minimum spanning tree algorithm using the cycle property
- An Explanation of Splaying
- scientific article; zbMATH DE number 1617246 (Why is no real title available?)
- scientific article; zbMATH DE number 177565 (Why is no real title available?)
- scientific article; zbMATH DE number 1099195 (Why is no real title available?)
- In pursuit of the dynamic optimality conjecture
- Introduction to algorithms
- On the efficiency of pairing heaps and related data structures
- Pairing heaps with O( n) decrease cost
- Quake heaps: a simple alternative to Fibonacci heaps
- Rank-pairing heaps
- Self-adjusting binary search trees
- Self-adjusting binary search trees: what makes them tick?
- Symmetric binary B-trees: Data structure and maintenance algorithms
- The pairing heap: A new form of self-adjusting heap
- The violation heap: a relaxed Fibonacci-like heap
- Thin heaps, thick heaps
- Why some heaps support constant-amortized-time decrease-key operations, and others do not
Cited in
(6)- A linear potential function for pairing heaps
- Pairing heaps, scrambled pairing and square-root trees
- scientific article; zbMATH DE number 2050887 (Why is no real title available?)
- Improved bounds for multipass pairing heaps and path-balanced binary search trees
- Smooth heaps and a dual view of self-adjusting data structures
- Strict Fibonacci heaps
This page was built for publication: Pairing heaps: the forward variant
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5005110)
