New merge sorting techniques

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

New merge sorting techniques

Full text

Pdf (163 KB)

Source

ACM Annual Conference/Annual Meeting archive
Preprints of papers presented at the 14th national meeting of the Association for Computing Machinery table of contents

Cambridge, Massachusetts

SESSION: Information sorting and retrieval, I table of contents

Pages: 1 - 4

Year of Publication: 1959

Authors

B. K. Betz	Minneapolis-Honeywell, Newton Highlands, Mass.
W. C. Carter	Minneapolis-Honeywell, Newton Highlands, Mass.

Sponsor

ACM: Association for Computing Machinery

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 14, Citation Count: 5

Additional Information:

cited by collaborative colleagues

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/612201.612219 What is a DOI?

CITED BY 5

	Samuel W. Reynolds, A generalized polyphase merge algorithm, Communications of the ACM, v.4 n.8, p.347-349, Aug. 1961
	R. L. Gilstad, Read-backward polyphase sorting, Communications of the ACM, v.6 n.5, p.220-223, May 1963
	W. A. Martin, Sorting, ACM Computing Surveys (CSUR), v.3 n.4, p.147-174, Dec. 1971
	Donald L. Shell, Optimizing the polyphase sort, Communications of the ACM, v.14 n.11, p.713-719, Nov. 1971
	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.

Collaborative Colleagues:

B. K. Betz: colleagues

W. C. Carter: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player