Competitive Analysis of Aggregate Max in Windowed Streaming
From MaRDI portal
Publication:3638032
DOI10.1007/978-3-642-02927-1_15zbMath1248.68568OpenAlexW1485839371MaRDI QIDQ3638032
Elias Koutsoupias, Luca Becchetti
Publication date: 14 July 2009
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02927-1_15
Related Items (9)
Two-way and one-way quantum and classical automata with advice for online minimization problems ⋮ Online \(L(2,1)\)-coloring problem on paths with restricted size of memory ⋮ Quantum versus classical online streaming algorithms with logarithmic size of memory ⋮ Classical and Quantum Computations with Restricted Memory ⋮ Streaming techniques and data aggregation in networks of tiny artefacts ⋮ Competitive analysis of maintaining frequent items of a stream ⋮ Quantum online algorithms with respect to space and advice complexity ⋮ Quantum online streaming algorithms with logarithmic memory ⋮ The fast algorithm for online \(k\)-server problem on trees
This page was built for publication: Competitive Analysis of Aggregate Max in Windowed Streaming
