1

SEWARD, HAROLD H., Information sorting in the application of electronic digital computers to business application (ASTIA 35462).

2

Edward H. Friend, Sorting on Electronic Computer Systems, Journal of the ACM (JACM), v.3 n.3, p.134-168, July 1956  [doi>10.1145/320831.320833]

W. D. Frazer , A. C. McKellar, Samplesort: A Sampling Approach to Minimal Storage Tree Sorting, Journal of the ACM (JACM), v.17 n.3, p.496-507, July 1970

Robert E. Noonan, Towards a canonical form for computer programs, Proceedings of the 1975 annual conference, p.235-240, January 1975

C. A. R. Hoare, Assertions: A Personal Perspective, IEEE Annals of the History of Computing, v.25 n.2, p.14-25, April 2003

Richard C. Singleton, Algorithm 347: an efficient algorithm for sorting with minimal storage [M1], Communications of the ACM, v.12 n.3, p.185-186, March 1969

J. Morris, ACM Algorithm 346: F-Test Probabilities, Communications of the ACM, v.12 n.3, p.184-185, March 1969

Stefan Edelkamp , Patrick Stiegeler, Implementing HEAPSORT with (n logn - 0.9n) and QUICKSORT with (n logn + 0.2n) comparisons, Journal of Experimental Algorithmics (JEA), 7, p.5, 2002

Michael H. Hall, A method of comparing the time requirements of sorting methods, Communications of the ACM, v.6 n.5, p.259-263, May 1963

Thomas N. Hibbard, An empirical study of minimal storage sorting, Communications of the ACM, v.6 n.5, p.206-213, May 1963

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

Tao Jiang , Ming Li , Paul Vitányi, A lower bound on the average-case complexity of shellsort, Journal of the ACM (JACM), v.47 n.5, p.905-911, Sept. 2000

W. A. Martin, Sorting, ACM Computing Surveys (CSUR), v.3 n.4, p.147-174, Dec. 1971

Martin Dowd , Yehoshua Perl , Larry Rudolph , Michael Saks, The periodic balanced sorting network, Journal of the ACM (JACM), v.36 n.4, p.738-757, Oct. 1989

R. M. Frank , R. B. Lazarus, A high-speed sorting procedure, Communications of the ACM, v.3 n.1, p.20-22, Jan. 1960

R. T. Smythe , J. A. Wellner, Asymptotic analysis of (3, 2, 1)-shell sort, Random Structures & Algorithms, v.21 n.1, p.59-75, August 2002

Thomas N. Hibbard, A Simple Sorting Algorithm, Journal of the ACM (JACM), v.10 n.2, p.142-150, April 1963

P. T. Chapman , K. Clark, Jr., The scan line approach to design rules checking: Computational experiences, Proceedings of the 21st conference on Design automation, p.235-241, June 25-27, 1984, Albuquerque, New Mexico, United States

David B. Wortman, Language directed computer performance evaluation, Proceedings of the 1974 annual conference, p.274-278, January 1974

M. Dowd , Y. Perl , M. Saks , L. Rudolph, The balanced sorting network, Proceedings of the second annual ACM symposium on Principles of distributed computing, p.161-172, August 17-19, 1983, Montreal, Quebec, Canada

Martin A. Goetz, Internal and tape sorting using the replacement-selection technique, Communications of the ACM, v.6 n.5, p.201-206, May 1963

C. A. R. Hoare, Assertions: a personal perspective, Software pioneers: contributions to software engineering, Springer-Verlag New York, Inc., New York, NY, 2002

Catherine McGeoch , Peter Sanders , Rudolf Fleischer , Paul R. Cohen , Doina Precup, Using finite experiments to study asymptotic performance, Experimental algorithmics: from algorithm design to robust and efficient software, Springer-Verlag New York, Inc., New York, NY, 2002

Phil Grouse, "Flowblocks": a technique for structured programming, ACM SIGPLAN Notices, v.13 n.2, p.46-56, February 1978

Paul Biggar , Nicholas Nash , Kevin Williams , David Gregg, An experimental study of sorting and branch prediction, Journal of Experimental Algorithmics (JEA), 12, June 2008

R. Cypher, A lower bound on the size of shellsort networks, Proceedings of the first annual ACM symposium on Parallel algorithms and architectures, p.58-63, June 18-21, 1989, Santa Fe, New Mexico, United States

Jeff Parker, Snakes and ladders: patterns in Heapsort, Journal of Computing Sciences in Colleges, v.24 n.2, December 2008

Gerth Stølting Brodal , Rolf Fagerberg , Gabriel Moruz, On the adaptiveness of Quicksort, Journal of Experimental Algorithmics (JEA), 12, June 2008

Fritz Henglein, Generic discrimination: sorting and paritioning unshared data in linear time, ACM SIGPLAN Notices, v.43 n.9, September 2008

David C. Van Voorhis, An economical construction for sorting networks, Proceedings of the May 6-10, 1974, national computer conference and exposition, May 06-10, 1974, Chicago, Illinois

D. L. Shell: colleagues