1. J. Boothroyd, Algorithm 201: Shellsort, Comm. ACM 6 8, August 1963, pp. 445.
2. C.R. Cook and Do Jin Kim, Best Sorting Algorithms for Nearly Sorted Lists, Comm. ACM 23 11, November 1980, pp. 620–624.
3. Greg N. Frederickson, Implicit Data Structures for the Dictionary Problem, JACM 30 1, January 1983, pp. 80–94.
4. C.A.R. Hoare, Algorithm 63 (Partition) -64 (Quicksort) -65 (Find), Comm. ACM 4 7, July 1961, pp. 321–322.
5. F.K. Hwang and S. Lin, A Simple Algorithm for Merging Two Disjoint Linearly-Ordered Sets, SIAM Journal of Computing 1 1, 1972.