References
- Brown , M. 1978 . Implementation and analysis of binomial queue algorithms . SIAM J. Comput. , 7 : 298 – 319 .
- Cormen , T. , Leiserson , C. , Rivest , R. and Stein , C. 2001 . Introduction to Algorithms, , 2 , Cambridge : The MIT Press .
- Elmasry , A. 2001 . “ Adaptive properties of pairing heaps ” . In Tech. Rep , 2001 – 29 . NJ, USA : DIMACS .
- Elmasry , A. 2004 . Parameterized self-adjusting heaps . J. Algorithms , 52 ( 2 ) : 103 – 119 .
- Elmasry , A. 20th ACM-SIAM Symposium on Discrete Algorithms . Pairing heaps with O log log n decrease cos , pp. 471 – 476 . New York, NY
- Fredman , M. 1999 . On the efficiency of pairing heaps and related data structures . J. ACM , 46 ( 4 ) : 473 – 501 .
- Fredman , M. 1999 . A priority queue transform 243 – 257 . London, , UK 3rd Workshop on Algorithm Engineering, LNCS 1668
- Fredman , M. and Tarjan , R. 1987 . Fibonacci heaps and their uses in improved network optimization algorithms . J. ACM , 34 : 596 – 615 .
- Fredman , M. , Sedgewick , R. , Sleator , D. and Tarjan , R. 1986 . The pairing heap: A new form of self-adjusting heap . Algorithmica , 1 ( 1 ) : 111 – 129 .
- Iacono , J. 2000 . Improved upper bounds for pairing heaps 32 – 45 . Bergen, , Norway Scandinavian Workshop on Algorithm Theory, LNCS 1851
- Jones , D. 1986 . An empirical comparison of priority-queues and event-set implementations . Commun. ACM , 29 ( 4 ) : 300 – 311 .
- Moret , B. and Shapiro , H. 1994 . An empirical assessment of algorithms for constructing a minimum spanning tree . DIMACS Monogr. Discrete Math. Theoret. Comput. Sci. , 15 : 99 – 117 .
- Pettie , S. 46th IEEE Symposium on Foundations of Computer Science . Towards a final analysis of pairing heaps , pp. 174 – 183 . Pittsburgh, PA
- Sleator , D. and Tarjan , R. 1986 . Self-adjusting heaps . SIAM J. Comput. , 15 ( 1 ) : 52 – 69 .
- Stasko , J. and Vitter , J. 1987 . Pairing heaps: Experiments and analysis . Commun. ACM , 30 ( 3 ) : 234 – 249 .
- Tarjan , R. 1985 . Amortized computational complexity . SIAM J. Algebr. Discrete Methods , 6 : 306 – 318 .
- Vuillemin , J. 1978 . A data structure for manipulating priority queues . Commun. ACM , 21 ( 4 ) : 309 – 314 .