1. Routing, merging and sorting on parallel models of computation;Borodin;Proc. 14th Ann. ACM Symp. on Theory of Computing,1982
2. On a stable minimum storage merging algorithm;Dudzinski;Inform. Process. Lett.,1981
3. Stable sorting in asymptotically optimal time and extra space;Horvath;J. ACM,1978
4. The Art of Computer Programming Vol. III: Sorting and Searching;Knuth,1975
5. An optimal ordering algorithm without a field of operation;Kronrod;Dokl. Akad. Nauk USSR,1969