Author:
Edelkamp Stefan,Wegener Ingo
Publisher
Springer Berlin Heidelberg
Reference28 articles.
1. R. D. Dutton. The weak-heap data structure. Technical report, University of Central Florida, Orlando, FL 32816, 1992.
2. R. D. Dutton. Weak-heap sort. BIT, 33:372–381, 1993.
3. S. Edelkamp and I. Wegener. On the performance of WEAK-HEAPSORT. Technical Report TR99-028, Electronic Colloquium on Computational Complexity, 1999. ISSN 1433-8092, 6th Year.
4. R. Fleischer. A tight lower bound for the worst case of Bottom-Up-Heapsort. Algorithmica, 11(2):104–115, 1994.
5. R. W. Floyd. ACM algorithm 245: Treesort 3. Communications of the ACM, 7(12):701, 1964.
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. QuickXsort: A Fast Sorting Scheme in Theory and Practice;Algorithmica;2019-10-22
2. QuickXsort: Efficient Sorting with n logn − 1.399n + o(n) Comparisons on Average;Computer Science - Theory and Applications;2014
3. Weak Heaps and Friends: Recent Developments;Lecture Notes in Computer Science;2013
4. A Survey on Priority Queues;Lecture Notes in Computer Science;2013
5. Homogeneous and Non-homogeneous Algorithms;Optimization Theory, Decision Making, and Operations Research Applications;2012-09-19