Fast hashing with strong concentration bounds

DOI10.1145/3357713.3384259MaRDI QIDQ5145010zbMATH OpenOpenAlexFDO

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

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)

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

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)