Non-empty Bins with Simple Tabulation Hashing

DOI10.1137/1.9781611975482.153zbMath1432.68079arXiv1810.13187OpenAlexW2952109546MaRDI QIDQ5236342

Anders Aamand, Mikkel Thorup

Publication date: 15 October 2019

Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1810.13187

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Data structures (68P05) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

This page was built for publication: Non-empty Bins with Simple Tabulation Hashing