Competitive analysis of maintaining frequent items of a stream
From MaRDI portal
Publication:476837
DOI10.1016/J.TCS.2014.09.011zbMATH Open1303.68159OpenAlexW1995654985MaRDI QIDQ476837FDOQ476837
Authors: Yiannis Giannakopoulos, Elias Koutsoupias 
Publication date: 2 December 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.09.011
Recommendations
- Competitive Analysis of Maintaining Frequent Items of a Stream
- The frequent items problem in online streaming under various performance measures
- The Frequent Items Problem in Online Streaming Under Various Performance Measures
- On Finding Frequent Elements in a Data Stream
- A randomized algorithm for finding frequent elements in streams using \(O(\log \log N)\) space
Cites Work
- The space complexity of approximating the frequency moments
- Data streams. Models and algorithms.
- Title not available (Why is that?)
- Online algorithms. The state of the art
- Finding repeated elements
- Random sampling with a reservoir
- Data streams: algorithms and applications.
- Encyclopedia of Database Systems
- Probability and Computing
- Who solved the secretary problem
- Selection and sorting with limited storage
- Learning from Data Streams
- Title not available (Why is that?)
- Competitive Analysis of Aggregate Max in Windowed Streaming
- Streaming techniques and data aggregation in networks of tiny artefacts
- Competitive Analysis of Maintaining Frequent Items of a Stream
Cited In (10)
- Quantum online streaming algorithms with logarithmic memory
- Competitive Analysis of Maintaining Frequent Items of a Stream
- Online-bounded analysis
- The frequent items problem in online streaming under various performance measures
- Online bounded analysis
- Quantum versus classical online streaming algorithms with logarithmic size of memory
- Quantum online algorithms with respect to space and advice complexity
- The fast algorithm for online \(k\)-server problem on trees
- Two-way and one-way quantum and classical automata with advice for online minimization problems
- Classical and Quantum Computations with Restricted Memory
This page was built for publication: Competitive analysis of maintaining frequent items of a stream
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q476837)
