The Frequent Items Problem in Online Streaming Under Various Performance Measures

DOI10.1142/S0129054115500239zbMath1337.68297arXiv1306.0771MaRDI QIDQ2947799

Abyayananda Maiti, Kim S. Larsen, Joan. Boyar

Publication date: 29 September 2015

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1306.0771

zbMATH Keywords

performance measuresonline algorithmsstreaming algorithms

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27)

Related Items (8)

Two-way and one-way quantum and classical automata with advice for online minimization problems ⋮ Quantum versus classical online streaming algorithms with logarithmic size of memory ⋮ Classical and Quantum Computations with Restricted Memory ⋮ Relative Worst-Order Analysis: A Survey ⋮ Quantum online algorithms with respect to space and advice complexity ⋮ Quantum online streaming algorithms with logarithmic memory ⋮ Relaxing the irrevocability requirement for online graph algorithms ⋮ The fast algorithm for online \(k\)-server problem on trees

Cites Work

• On the relative dominance of paging algorithms
• The relative worst-order ratio applied to paging
• Competitive snoopy caching
• A comparison of performance measures via online search
• Maintaining time-decaying stream aggregates

This page was built for publication: The Frequent Items Problem in Online Streaming Under Various Performance Measures