The design and analysis of coalesced hashing
The design and analysis of coalesced hashing
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Individual displacements for linear probing hashing with different insertion policies
ACM Transactions on Algorithms (TALG)
Exact distribution of individual displacements in linear probing hashing
ACM Transactions on Algorithms (TALG)
Hi-index | 0.00 |
We study the asymptotic distribution of the displacements in hashing with coalesced chains, for both late-insertion and early-insertion. Asymptotic formulas for means and variances follow. The method uses Poissonization and some stochastic calculus.