Exact distribution of individual displacements in linear probing hashing

@article{Viola2005ExactDO,
  title={Exact distribution of individual displacements in linear probing hashing},
  author={Alfredo Viola},
  journal={ACM Trans. Algorithms},
  year={2005},
  volume={1},
  pages={214-242}
}
  • Alfredo Viola
  • Published 2005
  • Mathematics, Computer Science
  • ACM Trans. Algorithms
  • This paper studies the distribution of individual displacements for the standard and the Robin Hood linear probing hashing algorithms. When the a table of size m has n elements, the distribution of the search cost of a random element is studied for both algorithms. Specifically, exact distributions for fixed m and n are found as well as when the table is α-full, and α strictly smaller than 1. Moreover, for full tables, limit laws for both algorithms are derived. 

    Figures and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    Distributional analysis of Robin Hood linear probing hashing with buckets
    • 1
    • Highly Influenced
    • PDF
    Distributional Analysis of the Parking Problem and Robin Hood Linear Probing Hashing with Buckets
    • 3
    • PDF
    Distributional analysis of Robin Hood linear probing hashing with buckets
    The Maximum Displacement for Linear Probing Hashing
    • 7
    • Highly Influenced
    • PDF
    A New Approach to Analyzing Robin Hood Hashing
    • 6
    • PDF
    Individual Displacements in Hashing with Coalesced Chains
    • 3
    • PDF
    A Unified Approach to Linear Probing Hashing with Buckets
    • 3
    • PDF
    Two-way hashing with separate chaining and linear probing
    • 7
    • PDF
    Analysis of Linear Time Sorting Algorithms
    • 4
    • PDF

    References

    Publications referenced by this paper.
    The art of computer programming, volume 3: (2nd ed.) sorting and searching
    • 1,543
    • Highly Influential