Sorting on Electronic Computer Systems

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Sorting on Electronic Computer Systems

Full text

Pdf (2.39 MB)

Source

Journal of the ACM (JACM) archive
Volume 3 , Issue 3 (July 1956) table of contents

Pages: 134 - 168

Year of Publication: 1956

ISSN:0004-5411

Author

Edward H. Friend

New York Life Insurance Co., New York, N. Y.

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 31, Citation Count: 24

Additional Information:

references cited by index terms

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/320831.320833 What is a DOI?

REFERENCES

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	Brief Description of Sorting Methods for the UNIVAC System. Electronic Computer Department Training Section, Remington Rand, January 19, 1954.
	2	EDPM Program Brief #3:705 Sorting Table. I.B.M. Corporation.
	3	EDPM Program Brief #8:702 Sorting Teahniques. I.B.M. Corporation.

CITED BY 24

	R. C. Bose , R. J. Nelson, A Sorting Problem, Journal of the ACM (JACM), v.9 n.2, p.282-296, April 1962
	W. A. Martin, Sorting, ACM Computing Surveys (CSUR), v.3 n.4, p.147-174, Dec. 1971
	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
	W. D. Frazer , C. K. Wong, Sorting by natural selection, Communications of the ACM, v.15 n.10, p.910-913, Oct. 1972
	Wei-Mei Chen , Gen-Huey Chen, Divide-and-conquer recurrences associated with generalized heaps, optimal merge, and related structures, Theoretical Computer Science, v.292 n.3, p.667-677, 31 January 2003
	D. L. Shell, A high-speed sorting procedure, Communications of the ACM, v.2 n.7, p.30-32, July 1959
	Anthony LaMarca , Richard E. Ladner, The influence of caches on the performance of sorting, Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, p.370-379, January 05-07, 1997, New Orleans, Louisiana, United States
	Stephen Glicksman, Concerning the Merging of Equal Length Tape Files, Journal of the ACM (JACM), v.12 n.2, p.254-258, April 1965
	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
	Ivan Flores, Computer Time for Address Calculation Sorting, Journal of the ACM (JACM), v.7 n.4, p.389-409, Oct. 1960
	M. Donald MacLaren, Internal Sorting by Radix Plus Sifting, Journal of the ACM (JACM), v.13 n.3, p.404-411, July 1966
	H. Nagler, Amphisbaenic Sorting, Journal of the ACM (JACM), v.6 n.4, p.459-468, Oct. 1959
	D. H. Lehmer, Sorting Cards with Respect to a Modulus, Journal of the ACM (JACM), v.4 n.1, p.41-46, Jan. 1957
	Lionello Lombardi, Mathematical Structure of Nonarithmetic Data Processing Procedures, Journal of the ACM (JACM), v.9 n.1, p.136-159, Jan. 1962
	Naila Rahman , Rajeev Raman, Adapting Radix Sort to the Memory Hierarchy, Journal of Experimental Algorithmics (JEA), 6, p.7-es, 2001
	Betty Jane Gassner, Sorting by replacement selecting, Communications of the ACM, v.10 n.2, p.89-93, Feb. 1967
	J. Nievergelt, Syllabus for low level performance for the qualifying examination in computer science, ACM SIGCSE Bulletin, v.2 n.2, p.43-53, June-July 1970
	Shun-Wen Cheng, Arbitrary long digit integer sorter HW/SW co-design, Proceedings of the 2003 conference on Asia South Pacific design automation, January 21-24, 2003, Kitakyushu, Japan
	Owen Astrachan, Bubble sort: an archaeological algorithmic analysis, ACM SIGCSE Bulletin, v.35 n.1, January 2003
	Naga Govindaraju , Jim Gray , Ritesh Kumar , Dinesh Manocha, GPUTeraSort: high performance graphics co-processor sorting for large database management, Proceedings of the 2006 ACM SIGMOD international conference on Management of data, June 27-29, 2006, Chicago, IL, USA
	Paul Biggar , Nicholas Nash , Kevin Williams , David Gregg, An experimental study of sorting and branch prediction, Journal of Experimental Algorithmics (JEA), 12, June 2008
	Martin A. Goetz, Some improvements in the technology of string merging and internal sorting, Proceedings of the April 21-23, 1964, spring joint computer conference, April 21-23, 1964, Washington, D.C.
	LeMinh Duc , Amandeep Singh Sidhu , Narendra S. Chaudhari, Hierarchical pathfinding and AI-based learning approach in strategy game design, International Journal of Computer Games Technology, v.2008 n.4, p.1-11, January 2008
	Kenneth E. Iverson, A programming language, Proceedings of the May 1-3, 1962, spring joint computer conference, May 01-03, 1962, San Francisco, California