An empirical comparison of priority-queue and event-set implementations
Communications of the ACM
The pairing heap: a new form of self-adjusting heap
Algorithmica
SIAM Journal on Computing
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Pairing heaps: experiments and analysis
Communications of the ACM
On the efficiency of pairing heaps and related data structures
Journal of the ACM (JACM)
A data structure for manipulating priority queues
Communications of the ACM
Pairing heaps with costless meld
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
| Hi-index | 0.00 |
A transformation, referred to as depletion, is defined for comparison-based data structures that implement priority queue operations. The depletion transform yields a representation of the data structure as a forest of heap-ordered trees. Under certain circumstances this transform can result in a useful alternative to the original data structure. As an application, we introduce a new variation of skew-heaps that efficiently implements decrease-key operations. Additionally, we construct a new version of the pairing heap data structure that experimentally exhibits improved efficiency