Improved Upper Bounds for Pairing Heaps
Data Structures and Algorithms
2014-01-23 v3
Abstract
Pairing heaps are shown to have constant amortized time Insert and Meld, thus showing that pairing heaps have the same amortized runtimes as Fibonacci heaps for all operations but Decrease-key.
Cite
@article{arxiv.1110.4428,
title = {Improved Upper Bounds for Pairing Heaps},
author = {John Iacono},
journal= {arXiv preprint arXiv:1110.4428},
year = {2014}
}
Comments
Preliminary version appeared at the Seventh Scandinavian Workshop on Algorithm Theory (SWAT 2000)