Selected papers that cite this one
- R. C. Bose and R. J. Nelson. A sorting problem. Journal of the ACM, 9(2):282-296, April 1962.
- Ivan Flores. Computer time for address calculation sorting. Journal of the ACM, 7(4):389-409, October 1960.
- Stephen Glicksman. Concerning the merging of equal length tape files. Journal of the ACM, 12(2):254-258, April 1965.
- Paul Hildebrandt and Harold Isbitz. Radix exchange -- an internal sorting method for digital computers. Journal of the ACM, 6(2):156-163, April 1959.
- Anthony LaMarca and Richard E. Ladner. The influence of caches on the performance of sorting. In Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 370-379, New Orleans, Louisiana, 5-7 January 1997.
- D. H. Lehmer. Sorting cards with respect to a modulus. Journal of the ACM, 4(1):41-46, January 1957.
- Lionello Lombardi. Mathematical structure of nonarithmetic data processing procedures. Journal of the ACM, 9(1):136-159, January 1962.
- John G. Mackinney. More on ``Amphisbaenic sorting''. Journal of the ACM, 8(1):118, January 1961.
- M. Donald MacLaren. Internal sorting by radix plus sifting. Journal of the ACM, 13(3):404-411, July 1966.
- J. I. Munro and V. Raman. Fast stable in-place sorting with O(n) data moves. Algorithmica, 16(2):151-160, August 1996.
- H. Nagler. Amphisbaenic sorting. Journal of the ACM, 6(4):459-468, October 1959.