The Analysis of Hashing Techniques That Exhibit k -ary Clustering

DOI10.1145/322092.322096zbMATH Open0388.68040OpenAlexW2018014111MaRDI QIDQ4170232FDOQ4170232

Authors: Leonidas Guibas 

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

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99) Algorithms in computer science (68W99)

Cited In (4)

• Open-addressing hashing with unequal-probability keys
• The analysis of double hashing
• The analysis of hashing with lazy deletions
• Analysis of Robin Hood and Other Hashing Algorithms Under the Random Probing Model, With and Without Deletions

This page was built for publication: The Analysis of Hashing Techniques That Exhibit k -ary Clustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4170232)