Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Adelson-Velskii, G.M., Landis, E.M.: An algorithm for the organization of information. Dokl. Akad. Nauk SSSR 3, 263–266 (1962)
2. Lecture Notes in Computer Science;TM Chan,2013
3. Driscoll, J.R., Gabow, H.N., Shrairman, R., Tarjan, R.E.: Relaxed heaps: An alternative to Fibonacci heaps with applications to parallel computation. Commun. ACM 31(11), 1343–1354 (1988)
4. Elmasry, A.: Pairing heaps with o(log log n) decrease cost. In: Claire Mathieu, editor, SODA, pp. 471–476. SIAM (2009)
5. Elmasry, A.: The violation heap: a relaxed Fibonacci-like heap. Discrete Math., Alg. and Appl. 2(4), 493–504 (2010)