Pairing heaps with O(log log n) decrease cost (2009)

by A Elmasry
Venue:20th ACM-SIAM symposium on Discrete Algorithms