The Power of Simple Tabulation Hashing
From MaRDI portal
DOI10.1145/2220357.2220361zbMath1281.68089arXiv1011.5200WikidataQ21994406 ScholiaQ21994406MaRDI QIDQ5395685
Publication date: 17 February 2014
Published in: Journal of the ACM, Proceedings of the forty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1011.5200
independence; hashing; linear probing; tabulation; cuckoo hashing; concentration bounds; minwise independence; tabulation hashing
68P10: Searching and sorting
68P05: Data structures
68P20: Information storage and retrieval of data
68W20: Randomized algorithms