Author:
Cantone Domenico,Cincotti Gianluca
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. S. Carlsson, A variant of heapsort with almost optimal number of comparisons, Information Processing Letters, Vol. 24, pp. 247–250, 1987.
2. E.E. Doberkat, An average analysis of Floyd’s algorithm to construct heaps, Information and Control, Vol.61, pp.114–131, 1984.
3. B. Durian, Quicksort without a stack, Lect. Notes Comp. Sci. Vol. 233, pp.283–289, Proc. of MFCS 1986.
4. R.W. Floyd, Treesort 3 (alg. 245), Comm. of ACM, Vol. 7, p. 701,1964.
5. G. Gonnet, R. Baeza-Yates, Handbook of algorithms and data structures, Addison-Wesley, Reading, MA, 1991.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献