Asymptotic distributions for the cost of linear probing hashing, Random Structures and Algorithms
by
Svante Janson
| Citations: | 11 - 3 self |
BibTeX
@MISC{Janson_asymptoticdistributions,
author = {Svante Janson},
title = {Asymptotic distributions for the cost of linear probing hashing, Random Structures and Algorithms},
year = {}
}
Years of Citing Articles
OpenURL
Abstract
Abstract. We study moments and asymptotic distributions of the construction cost, measured as the total displacement, for hash tables using linear probing. Four different methods are employed for different ranges of the parameters; together they yield a complete description. This extends earlier results by Flajolet, Poblete and Viola. The average cost of unsuccessful searches is considered too. 1.







