Probabilistic behavior of hash tables
Dawei Hong, Jean-Camille Birget, Shushuang Man
Abstract
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.
Create a lesson
Related papers
Social Learning of Ranking: Getting the Top Right despite Local Herding
Shahrzad Haddadan, Jie Gao
Adaptive Sorting, also in the BST Model
Ivor van der Hoog, Eva Rotenberg, Daniel Rutschmann
Exact and Asymptotic Analysis of Greedy Online Facility Assignment on Cycle Metrics
Md. Tanzeem Rahat, Md. Rawha Siddiqi Riad, Md. Manzurul Hasan
Metric Planarity Testing is Hard
Anubhav Dhar, Debajyoti Kar, Sándor Kisfaludi-Bak et al.
Almost Lossless Transfer for Cuttable Distributed Problems
Wojciech Wawrzyniak
Approximation Algorithms for Dual-Memory Request Scheduling in Disaggregated LLM Inference
Xin Wang, Hong Shen, Hui Tian et al.