Towards a Final Analysis of Pairing Heaps

Authors:
Seth Pettie
Affiliations:
Max Planck Institut fur Informatik
Venue:
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Year:
2005

Citing 10
Cited 8

Self-adjusting binary search trees

Journal of the ACM (JACM)
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)
LEDA: a platform for combinatorial and geometric computing

LEDA: a platform for combinatorial and geometric computing
Improved Upper Bounds for Pairing Heaps

SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Parameterized self-adjusting heaps

Journal of Algorithms
Dynamic Optimality " Almost

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science

Thin heaps, thick heaps

ACM Transactions on Algorithms (TALG)
Splay trees, Davenport-Schinzel sequences, and the deque conjecture

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
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
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
Research paper: The saga of minimum spanning trees

Computer Science Review
Rank-Pairing Heaps

SIAM Journal on Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

Fredman, Sedgewick, Sleator, and Tarjan proposed the pairing heap as a self-adjusting, streamlined version of the Fibonacci heap. It provably supports all priority queue operations in logarithmic time and is known to be extremely efficient in practice. However, despite its simplicity and empirical superiority, the pairing heap is one of the few popular data structures whose basic complexity remains open. In this paper we prove that pairing heaps support the deletemin operation in optimal logarithmic time and all other operations (insert, meld, and decreasekey) in time O(2^2 \sqrt {\log \log n} ) This result gives the first sub-logarithmic time bound for decreasekey and comes close to the lower bound of \Omega (\log \log n) established by Fredman.