Parameterized self-adjusting heaps

Authors:
Amr Elmasry
Affiliations:
Computer Science Department, Alexandria University, Alexandria, Egypt
Venue:
Journal of Algorithms
Year:
2004

Citing 7
Cited 5

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
Self-adjusting k-ary search trees

Journal of Algorithms
Pairing heaps: experiments and analysis

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

Journal of the ACM (JACM)

Towards a Final Analysis of Pairing Heaps

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Thin heaps, thick heaps

ACM Transactions on Algorithms (TALG)
Pairing heaps with O(log log n) decrease cost

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Pairing heaps with costless meld

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Strict fibonacci heaps

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a parameterized form for the standard implementation of the pairing heaps, skew heaps and skew-pairing heaps. When the node with the minimum value is to be deleted from the heap (deletemin operation), the procedures used to combine the resulting sub-trees into one tree depend on the value of a parameter k. When the value of k is equal to 2, the implementations are equivalent to the standard implementations. Using more complicated arguments, we show that for some predefined ranges of k this general form achieves the same bounds as the standard implementations. Finally, experimental results are conducted showing that for the pairing heaps, by tuning the value of k, the cost of the deletemin operation is reduced.