The frequent items problem in online streaming under various performance measures

DOI10.1007/978-3-642-40164-0_9MaRDI QIDQ2842773zbMATH OpenOpenAlexFDO

Authors Kim S. Larsen, Abyayananda Maiti, Joan Boyar

Publication date 16 August 2013

Published in Fundamentals of Computation Theory (Search for Journal in Brave)

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

zbMATH Keywords

online algorithmsperformance measuresstreaming algorithms

Mathematics Subject Classification ID

Theory of data (68P99) Online algorithms; streaming algorithms (68W27)

Recommendations

• The Frequent Items Problem in Online Streaming Under Various Performance Measures
• Competitive Analysis of Maintaining Frequent Items of a Stream
• Competitive analysis of maintaining frequent items of a stream

Cited in

(4)

• Competitive Analysis of Maintaining Frequent Items of a Stream
• The Frequent Items Problem in Online Streaming Under Various Performance Measures
• Competitive analysis of maintaining frequent items of a stream
• The frequent items problem, under polynomial decay, in the streaming model

This page was built for publication: The frequent items problem in online streaming under various performance measures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2842773)