The Analysis of Hashing Techniques That Exhibit k -ary Clustering
From MaRDI portal
Publication:4170232
DOI10.1145/322092.322096zbMath0388.68040OpenAlexW2018014111MaRDI QIDQ4170232
Publication date: 1978
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322092.322096
Analysis of algorithms and problem complexity (68Q25) Information storage and retrieval of data (68P20) Discrete mathematics in relation to computer science (68R99) Algorithms in computer science (68W99)
Related Items
Open-addressing hashing with unequal-probability keys ⋮ The analysis of hashing with lazy deletions ⋮ The analysis of double hashing ⋮ Analysis of Robin Hood and Other Hashing Algorithms Under the Random Probing Model, With and Without Deletions