Fast identification of heavy hitters by cached and packed group testing
From MaRDI portal
Publication:6536258
Recommendations
- An optimal algorithm for \(\ell_1\)-heavy hitters in insertion streams and related problems
- New algorithms for heavy hitters in data streams (invited talk)
- Beating CountSketch for heavy hitters in insertion streams
- Deterministic heavy hitters with sublinear query time
- Hierarchical Heavy Hitters with the Space Saving Algorithm
Cites work
- scientific article; zbMATH DE number 53302 (Why is no real title available?)
- scientific article; zbMATH DE number 1947405 (Why is no real title available?)
- An improved data stream summary: the count-min sketch and its applications
- Better space bounds for parameterized range majority and minority
- Bit-parallel string matching under Hamming distance in \(O(n\lceil m/w\rceil)\) worst case time
- Data streams: algorithms and applications.
- Dynamic maintenance of majority information in constant time per update
- Encodings for range majority queries
- Finding frequent items in data streams
- Finding repeated elements
- Range majority in constant time and linear space
- Regular expression matching with multi-strings and intervals
- The frequent items problem, under polynomial decay, in the streaming model
- Universal classes of hash functions
- What's hot and what's not: tracking most frequent items dynamically
This page was built for publication: Fast identification of heavy hitters by cached and packed group testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536258)
