Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	R. C. Bose , R. J. Nelson, A Sorting Problem, Journal of the ACM (JACM), v.9 n.2, p.282-296, April 1962  [doi>10.1145/321119.321126]
	2	DEMUTH, HOWARD B. A report on electronic data sorting. Stanford Research Institute Report No. 52410-2, Oct. 1956.
	3	Thomas N. Hibbard, Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting, Journal of the ACM (JACM), v.9 n.1, p.13-28, Jan. 1962  [doi>10.1145/321105.321108]
	4	--. A simple sorting Mgorithm. System Development Corp. Document TM-718/000/01, Aug. 1962.
	5	Paul Hildebrandt , Harold Isbitz, Radix Exchange—An Internal Sorting Method for Digital Computers, Journal of the ACM (JACM), v.6 n.2, p.156-163, April 1959  [doi>10.1145/320964.320972]
	6	HOARE, C. A.R. Algorithms 63 and 64. Comm. ACM 4 (1961), 321.
	7	R. M. Frank , R. B. Lazarus, A high-speed sorting procedure, Communications of the ACM, v.3 n.1, p.20-22, Jan. 1960  [doi>10.1145/366947.366957]
	8	D. L. Shell, A high-speed sorting procedure, Communications of the ACM, v.2 n.7, p.30-32, July 1959  [doi>10.1145/368370.368387]
	9	WINDLEY, P. F. Trees, forests and rearranging. Comput. J. 3 (1960), 84-88.