Subject
General Computer Science,Theoretical Computer Science
Reference18 articles.
1. A variant of HEAP SORT with almost optimal number of comparisons;Carlsson;Inform. Process. Lett.,1987
2. Average-case results on HEAPSORT;Carlsson;BIT,1987
3. Deleting the root of a heap;Doberkat;Acta Inform.,1982
4. An average case analysis of Floyd's algorithm to construct heaps;Doberkat;Inform. and Control,1984
5. A tight lower bound for the worst case of Bottom-up-Heapsort;Fleischer,1991
Cited by
43 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Sort race;Software: Practice and Experience;2022-05-09
2. JHeaps: An open-source library of priority queues;SoftwareX;2021-12
3. QuickXsort: A Fast Sorting Scheme in Theory and Practice;Algorithmica;2019-10-22
4. Shared-Memory Exact Minimum Cuts;2019 IEEE International Parallel and Distributed Processing Symposium (IPDPS);2019-05
5. Optimizing Binary Heaps;Theory of Computing Systems;2017-04-21