1 |
M. Fredman and R. Tarjan, 'Fibonacci heaps and their uses in improved network optimization algorithms,' JACM, 34(3), pp.596-615, 1987
DOI
ScienceOn
|
2 |
M. Fredrnan, R. Sedgewick, R. Sleator and R. Tarjan, 'The pairing heap: A new form of self-adjusting heap,' Algorithmica, 1, pp.111-129, March, 1986
DOI
|
3 |
T. J. Stasko and J. S. Vitter, 'Pairing heaps: experiments and analysis,' Communications of the ACM, 30(3), pp.234-249, 1987
DOI
ScienceOn
|
4 |
E. Horowitz, S. Sahni and D. Mehta, Fundamentals of Data Structures in C++, W. H. Freeman, San Francisco, 1995
|
5 |
A. LaMarca and R. Ladner, 'The Influence of Caches on the Performance of Heaps,' ACM Jounrnal of Experimental Algorithmics, 1(4), 1996
DOI
|
6 |
D. Jones, 'An empirical companson of prionty-queue and event- set implementation,' Communications of the Association for Computing Machinery, 29(4), pp.300-311, 1986
DOI
ScienceOn
|
7 |
H. Jung, S. Sahni, 'Supernode binary search trees,' International Journal of Foundations of Computer Science, 14(3), pp.465-490, Jun, 2003
DOI
ScienceOn
|