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
Sorting by Address Calculation
Full text PdfPdf (337 KB)
Source Journal of the ACM (JACM) archive
Volume 3 ,  Issue 3  (July 1956) table of contents
Pages: 169 - 174  
Year of Publication: 1956
ISSN:0004-5411
Authors
E. J. Isaac  Stanford Research Institute, Menlo Park, California
R. C. Singleton  Stanford Research Institute, Menlo Park, California
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 66,   Citation Count: 12
Additional Information:

cited by   index terms   collaborative colleagues   peer to peer  

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

CITED BY  12
Ivan Flores, Computer Time for Address Calculation Sorting, Journal of the ACM (JACM), v.7 n.4, p.389-409, Oct. 1960
Bush Jones, A variation on sorting by address calculation, Communications of the ACM, v.13 n.2, p.105-107, Feb 1970
D. H. Lehmer, Sorting Cards with Respect to a Modulus, Journal of the ACM (JACM), v.4 n.1, p.41-46, Jan. 1957
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
R. F. Deutscher , P. G. Sorenson , J. P. Tremblay, Distribution-dependent hashing functions and their characteristics, Proceedings of the 1975 ACM SIGMOD international conference on Management of data, May 14-16, 1975, San Jose, California
Michael E Tarter, Estimation of the cumulative by fourier series methods and application to the insertion problem, Proceedings of the 1968 23rd ACM national conference, p.491-497, August 27-29, 1968
 
Emil Jovanov , Veljko Milutinovic , Ali R. Hurson, Acceleration of Nonnumeric Operations Using Hardware Support for the Ordered Table Hashing Algorithms, IEEE Transactions on Computers, v.51 n.9, p.1026-1040, September 2002
George S. Lueker, Some Techniques for Solving Recurrences, ACM Computing Surveys (CSUR), v.12 n.4, p.419-436, Dec. 1980
 
Luc Vincent , Pierre Soille, Watersheds in Digital Spaces: An Efficient Algorithm Based on Immersion Simulations, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.13 n.6, p.583-598, June 1991
 
Pierre Soille , Hugues Talbot, Directional Morphological Filtering, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.23 n.11, p.1313-1329, November 2001
W. A. Martin, Sorting, ACM Computing Surveys (CSUR), v.3 n.4, p.147-174, Dec. 1971

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:
Design, Experimentation, Measurement, Performance, Theory

Collaborative Colleagues:
E. J. Isaac: colleagues
R. C. Singleton: colleagues

Peer to Peer - Readers of this Article have also read:

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