The analysis of linear probing sort by the use of a new mathematical transform
- 31 December 1984
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 5 (4) , 451-470
- https://doi.org/10.1016/0196-6774(84)90001-4
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Expected Length of the Longest Probe Sequence in Hash Code SearchingJournal of the ACM, 1981
- An algorithmic and complexity analysis of interpolation searchActa Informatica, 1980
- Ordered hash tablesThe Computer Journal, 1974
- An Occupancy Discipline and ApplicationsSIAM Journal on Applied Mathematics, 1966
- Internal Sorting by Radix Plus SiftingJournal of the ACM, 1966
- Analysis of a file addressing methodCommunications of the ACM, 1962
- Addressing for Random-Access StorageIBM Journal of Research and Development, 1957