Last-come-first-served hashing
Journal of Algorithms
The diagonal Poisson transform and its application to the analysis of a hashing scheme
Random Structures & Algorithms - Special issue: average-case analysis of algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Asymptotic distribution for the cost of linear probing hashing
Random Structures & Algorithms - Special issue on analysis of algorithms dedicated to Don Knuth on the occasion of his (100)8th birthday
Concrete Math
Phase transition for parking blocks, Brownian excursion and coalescence
Random Structures & Algorithms
Analysis of hashing algorithms and a new mathematical transform
Analysis of hashing algorithms and a new mathematical transform
Exact distribution of individual displacements in linear probing hashing
ACM Transactions on Algorithms (TALG)
Exact distribution of individual displacements in linear probing hashing
ACM Transactions on Algorithms (TALG)
Efficient data structures for sparse network representation
International Journal of Computer Mathematics - COMPLEX NETWORKS
Individual displacements in hashing with coalesced chains
Combinatorics, Probability and Computing
| Hi-index | 0.01 |
We study the distribution of the individual displacements in hashing with linear probing for three different versions: First Come, Last Come and Robin Hood. Asymptotic distributions and their moments are found when the the size of the hash table tends to infinity with the proportion of occupied cells converging to some α, 0 m and n can be obtained from the limits as m,n → ∞.We end with some results, conjectures and questions about the shape of the limit distributions. These have some relevance for computer applications.