Pairing heaps with O(log log n) decrease cost

Authors:
Amr Elmasry
Affiliations:
Max-Planck Institut für Informatik, Saarbrücken, Germany
Venue:
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Year:
2009

Citing 8
Cited 4

Self-adjusting binary search trees

Journal of the ACM (JACM)
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
Pairing heaps: experiments and analysis

Communications of the ACM
On the efficiency of pairing heaps and related data structures

Journal of the ACM (JACM)
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 costless meld

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
The violation heap: a relaxed Fibonacci-like heap

COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Strict fibonacci heaps

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Rank-Pairing Heaps

SIAM Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a variation of the pairing heaps for which the time bounds for all the operations match the lower bound proved by Fredman for a family of similar self-adjusting heaps. Namely, our heap structure requires O(1) for insert and findmin, O(log n) for delete-min, and O(log log n) for decrease-key and meld (all the bounds are in the amortized sense except for find-min).