\textsf{LotterySampling}: a randomized algorithm for the heavy hitters and top-k problems in data streams

DOI10.1007/978-3-031-22105-7_3MaRDI QIDQ6168928FDOQ6168928

Authors: Conrado Martínez, Gonzalo Solera-Pardo 

Publication date: 10 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Finding frequent items in data streams
• Data streams: algorithms and applications.
• Database Theory - ICDT 2005
• \textsf{LotterySampling}: a randomized algorithm for the heavy hitters and top-\(k\) problems in data streams

Cited In (2)

• Sampling from Dense Streams without Penalty
• \textsf{LotterySampling}: a randomized algorithm for the heavy hitters and top-\(k\) problems in data streams

This page was built for publication: \textsf{LotterySampling}: a randomized algorithm for the heavy hitters and top-\(k\) problems in data streams

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