Analysis of Uniform Hashing

DOI10.1145/2157.322407zbMath0625.68085OpenAlexW2144200930MaRDI QIDQ3028377

Per-Ake Larson

Publication date: 1983

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2157.322407

zbMATH Keywords

file organizationopen addressingfrequency loadingdouble hashingrandom probinguniform hashing

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (5)

A unified approach to linear probing hashing with buckets ⋮ Computing the probability of hash table/urn overflow ⋮ DOUBLE HASHING WITH MULTIPLE PASSBITS ⋮ Analysis of random probing hashing ⋮ Double hashing with passbits

This page was built for publication: Analysis of Uniform Hashing