1. D.E. Knuth, The art of computer programming, Vol. III: Sorting and searching, Addison-Wesley, Reading, Mass., 1973.
2. L.T. Pardo, Stable sorting and merging with optimal space and time bounds, SIAM J. Comp. 6(2) (1977) 351–372.
3. K. Duzinski, A. Dydek, On a stable minimum storage merging algorithm, Inf. Proc. Lett. 12(1) (1981) 5–8.
4. M.A. Kronrod, An optimal ordering algorithm without a field of operation. Dokl. Akad. Nauk USSR 186 (1969) 1256–1258.
5. H. Mannila, E. Ukkonen, A simple linear-time algorithm for in-situ merging, Inf. Proc. Lett. 18(1984) 203–208.