Author:
Nagao Atsuki,Seto Kazuhisa,Teruyama Junichi
Publisher
Springer International Publishing
Reference15 articles.
1. Bóna, M., Flynn, R.: Sorting a Permutation with Block Moves. arXiv:0806.2787v1
2. Martínez, C., Rösler, U.: Partial quicksort and quickpartitionsort. In: DMTCS Proceedings 2001, pp. 505–512 (2010)
3. Cranston, D., Sudborough, I.H., West, D.B.: Short Proofs for Cut-and-Paste Sorting of Permutations. Discrete Mathematics 307, 2866–2870 (2007)
4. Daskalakis, C., Karp, R.M., Mossel, E., Eiesenfeld, S.J., Verbin, E.: Sorting and selection in posets. SIAM Journal on Computing 40(3), 597–622 (2011)
5. Dweighter, H.: Elementary Problems. American Mathematical Monthly 82, 1010 (1975)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Efficient Algorithms for Sorting k-Sets in Bins;IEICE Transactions on Information and Systems;2015