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

by A Elmasry
Venue:in Proceedings of the 20th ACMSIAM Symposium on Discrete Algorithms (SODA), 2009