Pairing heaps with costless meld

Authors:
Amr Elmasry
Affiliations:
Max-Planck Institut für Informatik and University of Copenhagen
Venue:
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Year:
2010

Citing 11
Cited 0

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
Self adjusting heaps

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)
Improved Upper Bounds for Pairing Heaps

SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
A Priority Queue Transform

WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Parameterized self-adjusting heaps

Journal of Algorithms
Towards a Final Analysis of Pairing Heaps

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Pairing heaps with O(log log n) decrease cost

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

Improving the structure and analysis in [1], we give a variation of pairing heaps that has amortized zero cost per meld (compared to an O(lg lg n) in [1]) and the same amortized bounds for other operations. More precisely, the new pairing heap requires: no cost per meld, O(1) per find-min and insert, O(lg n) per delete-min, and O(lg lg n) per decreasekey, where n is the size of the priority queue at the time the operation is performed. These bounds are the best known for any self-adjusting heap, and match the lower bound established by Fredman for a family of such priority queues. Moreover, our structure is even simpler than that in [1].