Fast hashing with strong concentration bounds

DOI10.1145/3357713.3384259OpenAlexW3035048169MaRDI QIDQ5145010FDOQ5145010

Mathias Bæk Tejs Knudsen, Mikkel Thorup, Peter M. R. Rasmussen, Jakob Bæk Tejs Knudsen, Anders Aamand

Publication date: 19 January 2021

Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

samplinghashingChernoff boundsstreaming algorithmsconcentration bounds

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited In (2)

• Strongly Constrained Discrete Hashing
• Multidimensional quantile hashing is very efficient for nonuniform distributions

This page was built for publication: Fast hashing with strong concentration bounds

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