%0 Journal Article
%T Improved Upper Bounds for Pairing Heaps
%A John Iacono
%J Computer Science
%D 2011
%I arXiv
%X 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.
%U http://arxiv.org/abs/1110.4428v3