1. S. Carlsson and J. Chen. The complexity of heaps. In Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms, SIAM, (1992),393-402.
2. Best case lower bounds for Heapsort;Ding;Computing,1992
3. Heaps on heaps;Gonnet;SIAM Journal on Computing,1986
4. J. Katajainen, The ultimate heapsort, DIKU Report 96/42, Department of Computer Science, University of Copenhagen, 1996.
5. D.E. Knuth, The Art of Computer Programming -- Sorting and Searching, 2nd Edition, Addison Wesley, 1998.