Distributional analysis of Robin Hood linear probing hashing with buckets
This paper presents the first distributional analysis of a linear probing hashing scheme with buckets of size $b$. The exact distribution of the cost of successful searches for a $b \alpha$ -full table is obtained, and moments and asymptotic results are derived. With the use of the Poisson transform...
Main Author: | Alfredo Viola |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2005-01-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/3386/pdf |
Similar Items
-
Randomized Optimization: a Probabilistic Analysis
by: Jean Cardinal, et al.
Published: (2007-01-01) -
Tail Bounds for the Wiener Index of Random Trees
by: Tämur Ali Khan, et al.
Published: (2007-01-01) -
Asymptotics of Riordan arrays
by: Mark C. Wilson
Published: (2005-01-01) -
Non Uniform Random Walks
by: Nisheeth Vishnoi
Published: (2003-01-01) -
Stokes polyhedra for $X$-shaped polyminos
by: Yu. Baryshnikov, et al.
Published: (2012-01-01)