On Finding Frequent Elements in a Data Stream
From MaRDI portal
Recommendations
- Finding frequent items in data streams
- Finding frequent items in data streams
- A randomized algorithm for finding frequent elements in streams using O( N) space
- Lower Bounds on Frequency Estimation of Data Streams (Extended Abstract)
- Efficient computation of frequent and top-k elements in data streams
Cited in
(11)- Finding frequent items in data streams
- A randomized algorithm for finding frequent elements in streams using O( N) space
- Finding Frequent Items in a Turnstile Data Stream
- Finding Frequent Elements in Non-bursty Streams
- Finding duplicates in a data stream
- Finding frequent items in data streams
- Competitive analysis of maintaining frequent items of a stream
- Efficient computation of frequent and top-k elements in data streams
- Range‐Efficient Counting of Distinct Elements in a Massive Data Stream
- LATIN 2004: Theoretical Informatics
- The frequent items problem, under polynomial decay, in the streaming model
This page was built for publication: On Finding Frequent Elements in a Data Stream
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3603495)