Competitive Analysis of Maintaining Frequent Items of a Stream

DOI10.1007/978-3-642-31155-0_30zbMATH Open1357.68300OpenAlexW1522028810MaRDI QIDQ2904569FDOQ2904569

Authors: Yiannis Giannakopoulos, Elias Koutsoupias 

Publication date: 14 August 2012

Published in: Algorithm Theory – SWAT 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31155-0_30

Recommendations

• Competitive analysis of maintaining frequent items of a stream
• scientific article; zbMATH DE number 2086663
• Finding frequent items in data streams
• The frequent items problem in online streaming under various performance measures
• The Frequent Items Problem in Online Streaming Under Various Performance Measures

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27)

Cited In (3)

• The frequent items problem in online streaming under various performance measures
• A randomized algorithm for finding frequent elements in streams using \(O(\log \log N)\) space
• Competitive analysis of maintaining frequent items of a stream

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 Q2904569)