1. Adelson-Velskii, G., Landis, E.: On an information organization algorithm. Doklady Akademia Nauk SSSR 146, 263–266 (1962)
2. Brodal, G.S.: Worst-case efficient priority queues. In: Proceedings of the 7th ACM-SIAM symp. on Disc. Algorithms, pp. 52–58 (1996)
3. Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press, Cambridge (2001)
4. Driscoll, J., Gabow, H., Shrairman, R., Tarjan, R.E.: Relaxed heaps: An alternative to Fibonacci heaps with applications to parallel computation. ACM Comm. 31, 1343–1354 (1988)
5. Elmasry, A.: Pairing heaps with O(loglogn) decrease cost. In: Proceedings of the 20th ACM-SIAM symp. on Disc. Algorithms, pp. 471–476 (2009)