Improved Concentration Bounds for Count-Sketch

DOI10.1137/1.9781611973402.51zbMath1422.68052arXiv1207.5200OpenAlexW4205108489MaRDI QIDQ5384012

Gregory Minton, Eric Price

Publication date: 20 June 2019

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

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Data structures (68P05) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items

Optimizing the confidence bound of count-min sketches to estimate the streaming big data query results more precisely ⋮ Perfect $L_p$ Sampling in a Data Stream