Individual displacements for linear probing hashing with different insertion policies

@article{Janson2005IndividualDF,
  title={Individual displacements for linear probing hashing with different insertion policies},
  author={Svante Janson},
  journal={ACM Trans. Algorithms},
  year={2005},
  volume={1},
  pages={177-213}
}
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 < α < 1. (In the case of Last Come, the results are more complicated and less complete than in the other cases.)We also show, using the diagonal Poisson transform studied by… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Similar Papers

Loading similar papers…