Subject
General Computer Science,Theoretical Computer Science
Reference19 articles.
1. A variant of heapsort with almost optimal number of comparisons;Carlsson;Inform. Process. Lett.,1987
2. An average analysis of Floyd's algorithm to construct heaps;Doberkat;Inform. Control,1984
3. B. Durian, Quicksort without a stack, Lecture Notes in Computer Science, Vol. 233, Proc. MFCS, Springer, New York, 1986, pp. 283–289.
4. Treesort 3 (alg. 245);Floyd;Comm. ACM,1964
5. Handbook of Algorithms and Data Structures;Gonnet,1991
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献