Author:
Iwama Kazuo,Teruyama Junichi
Publisher
Springer International Publishing
Reference15 articles.
1. Ayala-Rincón, M., De Abreu, B.T., De Siqueira, J.: A variant of the Ford-Johnson algorithm that is more space efficient. Information Processing Letters 102(5), 201–207 (2007)
2. Edelkamp, S., Weiß, A.: QuickXsort: Efficient Sorting with n logn - 1.399n + o(n) Comparisons on Average. In: CSR 2014, pp. 139–152
3. Ford, L.R., Johnson, S.M.: A tournament problem. The American Mathematical Monthly 66(5), 387–389 (1959)
4. Hwang, F.K., Lin, S.: Optimal merging of 2 elements with n elements. Acta Informatica 1, 145–158 (1971)
5. Iwama, K., Teruyama, J.: Improved Average Complexity for Comparison-Based Sorting (2017). arXiv:1705.00849
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the Average Case of MergeInsertion;Theory of Computing Systems;2020-06-30
2. QuickXsort: A Fast Sorting Scheme in Theory and Practice;Algorithmica;2019-10-22
3. On the Average Case of MergeInsertion;Lecture Notes in Computer Science;2019
4. Small Complexity Gaps for Comparison-Based Sorting;Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications;2018