1 paper · 2 filters
Ketan Dalal, Luc Devroye, Ebrahim Malalla
We introduce linear probing hashing schemes that construct a hash table of size n, with constant load factor α, on which the worst-case unsuccessful search time is asymptotical…