The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
Pairing Heaps with Costless Meld
[article]
2009
arXiv
pre-print
Improving the structure and analysis in elm0, we give a variation of the pairing heaps that has amortized zero cost per meld (compared to an O(n) in elm0) and the same amortized bounds for all other operations. More precisely, the new pairing heap requires: no cost per meld, O(1) per find-min and insert, O(n) per delete-min, and O(n) per decrease-key. These bounds are the best known for any self-adjusting heap, and match the lower bound proved by Fredman for a family of such heaps. Moreover,
arXiv:0903.4130v2
fatcat:o26mps2gyvenfkysnk625hqwiu