2000 character limit reached
Improved Upper Bounds for Pairing Heaps (1110.4428v3)
Published 20 Oct 2011 in cs.DS
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.