A Sorting Problem

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A Sorting Problem

Full text

Pdf (609 KB)

Source

Journal of the ACM (JACM) archive
Volume 9 , Issue 2 (April 1962) table of contents

Pages: 282 - 296

Year of Publication: 1962

ISSN:0004-5411

Authors

R. C. Bose	University of North Carolina, Chapel Hill, North Carolina
R. J. Nelson	Case Institute of Technology, Cleveland, Ohio

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 7, Downloads (12 Months): 46, Citation Count: 12

Additional Information:

references cited by index terms collaborative colleagues peer to peer

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/321119.321126 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	DEMUTH, HowAuD B. A report on electronic data sorting. Stanford Research Institute, Oct. I956.
	2	Ivan Flores, Analysis of Internal Computer Sorting, Journal of the ACM (JACM), v.8 n.1, p.41-80, Jan. 1961 [doi>10.1145/321052.321055]
	3	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]
	4	GondsTIne, HERMAn AnD YON NEUMAN: John'. Planning and Coding Problems for an Electronic CsmpuSng In.sIrumenl. Pt. II, Vol. II. Institute for Advanccd Study, Princeton, 1948.

CITED BY 12

	Stanislaw J. Piestrak, The Minimal Test Set for Multioutput Threshold Circuits Implemented as Sorting Networks, IEEE Transactions on Computers, v.42 n.6, p.700-712, June 1993
	Thomas N. Hibbard, An empirical study of minimal storage sorting, Communications of the ACM, v.6 n.5, p.206-213, May 1963
	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, A Simple Sorting Algorithm, Journal of the ACM (JACM), v.10 n.2, p.142-150, April 1963
	H. Lynn Beus, The Use of Information in Sorting, Journal of the ACM (JACM), v.17 n.3, p.482-495, July 1970
	Minyoung Yun , Young Wook Keum, On extremal sort sequences, The Korean Journal of Computational & Applied Mathematics, v.9 n.1, p.239-252, January 2002
	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
	Owen Astrachan, Bubble sort: an archaeological algorithmic analysis, ACM SIGCSE Bulletin, v.35 n.1, January 2003
	I. Parberry, A computer assisted optimal depth lower bound for sorting networks with nine inputs, Proceedings of the 1989 ACM/IEEE conference on Supercomputing, p.152-161, November 12-17, 1989, Reno, Nevada, United States
	Biographies, IEEE Annals of the History of Computing, v.26 n.2, p.75-83, April 2004
	W. A. Martin, Sorting, ACM Computing Surveys (CSUR), v.3 n.4, p.147-174, Dec. 1971
	Kenneth J. Thurber, Interconnection networks: a survey and assessment, Proceedings of the May 6-10, 1974, national computer conference and exposition, May 06-10, 1974, Chicago, Illinois