ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Analysis of Internal Computer Sorting
Full text PdfPdf (1.93 MB)
Source Journal of the ACM (JACM) archive
Volume 8 ,  Issue 1  (January 1961) table of contents
Pages: 41 - 80  
Year of Publication: 1961
ISSN:0004-5411
Author
Ivan Flores  Consultant, Norwalk, Conn.
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 15,   Citation Count: 12
Additional Information:

cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/321052.321055
What is a DOI?

CITED BY  12
Barbara S. Brawn , Frances G. Gustavson , Efrem S. Mankin, Sorting in a paging environment, Communications of the ACM, v.13 n.8, p.483-494, Aug. 1970
Samuel W. Reynolds, A generalized polyphase merge algorithm, Communications of the ACM, v.4 n.8, p.347-349, Aug. 1961
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
B. F. Cheydleur , R. Kronmal , M. Tarter, Analysis of computational systems: Cumulative polygon address calculation sorting, Proceedings of the 1965 20th national conference, p.376-385, August 24-26, 1965, Cleveland, Ohio, United States
Michael E. Tarter , Richard A. Kronmal, Non-uniform key distribution and address calculation sorting, Proceedings of the 1966 21st national conference, p.331-337, January 1966
Armando G. Mendoza, A dispersion pass algorithm for the polyphase merge, Communications of the ACM, v.5 n.10, p.502-504, Oct. 1962
H. Lynn Beus, The Use of Information in Sorting, Journal of the ACM (JACM), v.17 n.3, p.482-495, July 1970
Owen Astrachan, Bubble sort: an archaeological algorithmic analysis, ACM SIGCSE Bulletin, v.35 n.1, January 2003
Anthony J. Winkler , Alfred G. Dale, File structure determination, Proceedings of the 1971 international ACM SIGIR conference on Information storage and retrieval, April 01-02, 1971, College Park, Maryland
Arnold F. Goodman, Measurement of computer systems: an introduction, Proceedings of the December 5-7, 1972, fall joint computer conference, part II, December 05-07, 1972, Anaheim, California

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Sorting and searching


General Terms:
Measurement, Performance, Theory

Collaborative Colleagues:
Ivan Flores: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player