1 |
D. E. Knuth, "The Art of Computer Programming," Addison-Wesley, Vol. 3: Sorting and Searching, 1973
|
2 |
P. S. Kim and A. Kutzner, "Stable Minimum Storage Merging by Symmetric Comparisons," In Albers, S., Radzik, T. (eds.), Algorithms-ESA 2004, Springer, Lecture Notes in Computer Science 3221, pp. 714-723, 2004
|
3 |
J. Salowe and W. Steiger. "Simplified stable merging tasks," Journal of Algorithms, 8:557-571, 1987
DOI
|
4 |
L. T. Pardo. "Stable sorting and merging with optimal space and time bounds," SIAM Journal on Computing, 6(2):351-372, June 1977
DOI
|
5 |
K. Dudzinski and A. Dydek, "On a Stable Storage Merging Algorithm," Information Processing Letters, Vol. 12, No. 1, pp. 5-8, 1981
DOI
ScienceOn
|