1. T. D. Bui and Thanh Mai,Efficient algorithms for sorting by comparisons. Department of Computer Science Report, Concordia University, Montreal, Québec, Canada.
2. C. Christen,Improving the bounds on optimal merging. Proc. 19th Annual IEEE Conf. on the Foundations of Comp. Sci., (1978), 259–266.
3. L. R. Ford Jr. and S. M. Johnson,A tournament problem. AMM 66, 5 (1959), 387–389.
4. F. K. Hwang and S. Lin,A simple algorithm for merging two disjoint linearly — ordered sets. SIAM J. Computing 1, 1 (1972), 31–39.
5. D. E. Knuth,The Art of Computer Programming, Vol. 3: Sorting and Searching. Addison-Wesley, Reading, Mass., (1973), 181–209.