Author:
Iwama Kazuo,Teruyama Junichi
Funder
Japan Science and Technology Agency
Japan Society for the Promotion of Science
Subject
General Computer Science,Theoretical Computer Science
Reference19 articles.
1. A variant of the Ford–Johnson algorithm that is more space efficient;Ayala-Rincón;Inf. Process. Lett.,2007
2. Reversal-bounded acceptors and intersections of linear languages;Book;SIAM J. Comput.,1974
3. The results of S(15) and S(19) to minimum-comparison sorting problem;Cheng;J. Front. Comput. Sci. Technol.,2007
4. QuickXsort: efficient sorting with nlogn−1.399n+o(n) comparisons on average;Edelkamp;CSR,2014
5. A tournament problem;Ford;Am. Math. Mon.,1959
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. 2 mm: A new technique for sorting data;Theoretical Computer Science;2022-04
2. On the Upper Bound of the Complexity of Sorting;Computational Mathematics and Mathematical Physics;2021-02