Rank-Pairing Heaps

Authors:
Bernhard Haeupler;Siddhartha Sen;Robert E. Tarjan
Affiliations:
haeupler@mit.edu;sssix@cs.princeton.edu;ret@cs.princeton.edu
Venue:
SIAM Journal on Computing
Year:
2011

Citing 22
Cited 0

The pairing heap: a new form of self-adjusting heap

Algorithmica
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs

Combinatorica
Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation

Communications of the ACM
Trans-dichotomous algorithms for minimum spanning trees and shortest paths

Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Pairing heaps: experiments and analysis

Communications of the ACM
Worst-case efficient priority queues

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
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
Meldable heaps and boolean union-find

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Theory of 2-3 heaps

Discrete Applied Mathematics - Special issue: Special issue devoted to the fifth annual international computing and combinatories conference (COCOON'99) Tokyo, Japan 26-28 July 1999
Integer Sorting in 0(n sqrt (log log n)) Expected Time and Linear Space

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Theory of Trinomial Heaps

COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
A general technique for implementation of efficient priority queues

ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
Integer priority queues with decrease key in constant time and the single source shortest paths problem

Journal of Computer and System Sciences - Special issue: STOC 2003
Towards a Final Analysis of Pairing Heaps

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Equivalence between priority queues and sorting

Journal of the ACM (JACM)
Thin heaps, thick heaps

ACM Transactions on Algorithms (TALG)
A dichromatic framework for balanced trees

SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
Two-tier relaxed heaps

Acta Informatica
Pairing heaps with O(log log n) decrease cost

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
The violation heap: a relaxed Fibonacci-like heap

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce the rank-pairing heap, an implementation of heaps that combines the asymptotic efficiency of Fibonacci heaps with much of the simplicity of pairing heaps. Other heap implementations that match the bounds of Fibonacci heaps do so by maintaining a balance condition on the trees representing the heap. In contrast to these structures but like pairing heaps, our trees can evolve to have arbitrary (unbalanced) structure. Also like pairing heaps, our structure requires at most one cut and no other restructuring per key decrease, in the worst case: the only changes that can cascade during a key decrease are changes in node ranks. Although our data structure is simple, its analysis is not.