Improved Upper Bounds for Pairing Heaps
  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. 
John Iacono
cs.DS