1. Atallah M.J, and Kosaraju S.R, "An Adversary Lower Bound For Sorting", Information Processing Letters", 13, 2 (1981), 55–57.
2. Floyd, R. and Rivest, R., "Expected Time Bounds for Selection", Communications of the ACM, 18, (1975), 165–172.
3. Fredman, M.L. and Tarjan, R.E., "Fibonacci heaps and their uses in improved network optimization algorithms, Journal of the ACM, 34, 3 (1987), 596–615.
4. Knuth, D.E., The Art of Computer Programming, Vol. 3: Sorting and Searching (Addison-Wesley, Reading, MA, 1973).
5. Navlakha, J.K., "Finding the k-th largest element in a large heap in O (k log log n) time", Proceedings of the 1982 Conference of Information Science and Systems, Princeton, (1982) 66–69.