Fast identification of heavy hitters by cached and packed group testing
From MaRDI portal
Publication:6536258
DOI10.1007/978-3-030-32686-9_17zbMATH Open1539.68088MaRDI QIDQ6536258
Hiroki Arimura, Yusaku Kaneta, Takeaki Uno
Publication date: 19 April 2024
Data structures (68P05) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Dynamic maintenance of majority information in constant time per update
- The frequent items problem, under polynomial decay, in the streaming model
- Finding repeated elements
- Universal classes of hash functions
- Finding frequent items in data streams
- Range majority in constant time and linear space
- Bit-parallel string matching under Hamming distance in \(O(n\lceil m/w\rceil)\) worst case time
- Better Space Bounds for Parameterized Range Majority and Minority
- An improved data stream summary: the count-min sketch and its applications
- Encodings for Range Majority Queries
- 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)
