Improved upper bounds for pairing heaps
From MaRDI portal
Recommendations
Cited in
(26)- The pairing heap: A new form of self-adjusting heap
- A priority queue with the time-finger property
- Parameterized analysis of paging and list update algorithms
- On the hierarchy of distribution-sensitive properties for data structures
- Generalizing a theorem of Wilber on rotations in binary search trees to encompass unordered binary trees
- Practical distribution-sensitive point location in triangulations
- A history of distribution-sensitive data structures
- A survey on priority queues
- A tight lower bound for top-down skew heaps
- A linear potential function for pairing heaps
- Pairing heaps, scrambled pairing and square-root trees
- Pairing heaps with costless meld
- scientific article; zbMATH DE number 2050887 (Why is no real title available?)
- Toward optimal self-adjusting heaps
- Pairing heaps: the forward variant
- Improved bounds for multipass pairing heaps and path-balanced binary search trees
- Smooth heaps and a dual view of self-adjusting data structures
- Rank-Pairing Heaps
- Proximate point searching
- Amortized complexity verified
- Efficiency of self-adjusting heaps
- Analysis of smooth heaps and slim heaps
- Fast and simple sorting using partial information
- Simpler universally optimal Dijkstra
- The derivation of a tighter bound for top-down skew heaps
- ATLAS: automated amortised complexity analysis of self-adjusting data structures
This page was built for publication: Improved upper bounds for pairing heaps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2721966)
