Fast Sorting In-Place Sorting with O(n) Data
暂无分享,去创建一个
[1] Edward H. Friend,et al. Sorting on Electronic Computer Systems , 1956, JACM.
[2] Venkatesh Raman,et al. Selection from Read-Only Memory and Sorting with Optimum Data Movement , 1992, FSTTCS.
[3] Michael A. Langston,et al. Practical in-place merging , 1987, CACM.
[4] Luis Trabb Pardo. Stable Sorting and Merging with Optimal Space and Time Bounds , 1977, SIAM J. Comput..
[5] Venkatesh Raman,et al. Stable in situ sorting and minimum data movement , 1990, BIT.
[6] J. IAN MUNRO,et al. An Implicit Data Structure Supporting Insertion, Deletion, and Search in O(log² n) Time , 1986, J. Comput. Syst. Sci..
[7] Venkatesh Raman,et al. Sorting with Minimum Data Movement , 1992, J. Algorithms.
[8] Venkatesh Raman,et al. Sorting with Minimum Data Movement (Preliminary Draft) , 1989, WADS.
[9] J. Ian Munro,et al. Implicit Data Structures for Fast Search and Update , 1980, J. Comput. Syst. Sci..
[10] Venkatesh Raman. Sorting in-place with minimum data movement , 1992 .
[11] Michael A. Langston,et al. Fast Stable Merging and Sorting in Constant Extra Space , 1992, Comput. J..
[12] Jyrki Katajainen,et al. Sorting Multisets Stably in Minimum Space , 1992, SWAT.
[13] Venkatesh Raman,et al. Sorting Multisets and Vectors In-Place , 1991, WADS.
[14] Derick Wood,et al. Implicit Selection , 1988, SWAT.
[15] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .