Asymptotic distribution for the cost of linear probing hashing
From MaRDI portal
Publication:2772927
DOI10.1002/rsa.10009zbMath0992.68232OpenAlexW2022743546MaRDI QIDQ2772927
Publication date: 11 September 2002
Published in: Random Structures and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.10009
Related Items (16)
Parking functions for mappings ⋮ A unified approach to linear probing hashing with buckets ⋮ Deviation results for sparse tables in hashing with linear probing ⋮ Parking distributions on trees ⋮ Large-deviation results for triangular arrays of semiexponential random variables ⋮ Conditional large and moderate deviations for sums of discrete random variables. Combinatoric applications ⋮ Parking functions: from combinatorics to probability ⋮ Exact formulas for moments of sums of classical parking functions ⋮ Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation ⋮ Analysis of a drop-push model for percolation and coagulation ⋮ Reflected Brownian bridge local time conditioned on its local time at the origin ⋮ A conditional Berry–Esseen inequality ⋮ Inference for conditioned Galton-Watson trees from their Harris path ⋮ The sum of powers of subtree sizes for conditioned Galton-Watson trees ⋮ Where should you park your car? The $\frac{1}{2}$ rule ⋮ Cycle structure of random parking functions
Cites Work
This page was built for publication: Asymptotic distribution for the cost of linear probing hashing
