Sorting by Address Calculation
Journal of the ACM (JACM)
Computer Time for Address Calculation Sorting
Journal of the ACM (JACM)
Analysis of Internal Computer Sorting
Journal of the ACM (JACM)
Communications of the ACM
ACM Computing Surveys (CSUR)
Distribution-dependent hashing functions and their characteristics
SIGMOD '75 Proceedings of the 1975 ACM SIGMOD international conference on Management of data
Estimation of the cumulative by fourier series methods and application to the insertion problem
ACM '68 Proceedings of the 1968 23rd ACM national conference
Non-uniform key distribution and address calculation sorting
ACM '66 Proceedings of the 1966 21st national conference
Expandable open addressing hash table storage and retrieval
SIGFIDET '71 Proceedings of the 1971 ACM SIGFIDET (now SIGMOD) Workshop on Data Description, Access and Control
Hi-index | 0.00 |
The cumulative polygon address calculation sort has been shown to be of considerably more general use, in terms of speed, robustness, and capacity than previously investigated algorithms. A method will be given which will make it possible for the file to be sorted in place instead of in a work area. There will not be space in this paper to derive expressions for the expected number of comparisons and exchanges as well as storage and time estimates. Instead the effect of the simplifying assumptions will be discussed in the light of their effect upon “sorting in place.”