Probabilistic behavior of hash tables
<|reference_start|>Probabilistic behavior of hash tables: We extend a result of Goldreich and Ron about estimating the collision probability of a hash function. Their estimate has a polynomial tail. We prove that when the load factor is greater than a certain constant, the estimator has a gaussian tail. As an application we find an estimate of an upper bound for the average search time in hashing with chaining, for a particular user (we allow the overall key distribution to be different from the key distribution of a particular user). The estimator has a gaussian tail.<|reference_end|>
@article{hong2003probabilistic,
    title={Probabilistic behavior of hash tables},
    author={Dawei Hong, Jean-Camille Birget, Shushuang Man},
    journal={arXiv preprint arXiv:cs/0303022},
    year={2003},
    archivePrefix={arXiv},
    eprint={cs/0303022},
    primaryClass={cs.DS cs.DB}
}