Competitive Analysis of Aggregate Max in Windowed Streaming

DOI10.1007/978-3-642-02927-1_15MaRDI QIDQ3638032zbMATH OpenOpenAlexFDO

Authors Luca Becchetti, Elias Koutsoupias

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

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27)

Recommendations

• A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window
• Approximating Multiple Arrival Streams by Using Aggregation
• scientific article; zbMATH DE number 1929937
• Distributed streams algorithms for sliding windows
• A survey on streaming algorithms for maximizing submodular functions
• Competitive Analysis of Scheduling Algorithms for Aggregated Links
• Competitive analysis of scheduling algorithms for aggregated links

Cited in

(10)

• 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
• Quantum online streaming algorithms with logarithmic memory
• Streaming techniques and data aggregation in networks of tiny artefacts
• Competitive analysis of maintaining frequent items of a stream
• 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
• Time efficient implementation for online k-server problem on trees
• Quantum online algorithms with respect to space and advice complexity

This page was built for publication: Competitive Analysis of Aggregate Max in Windowed Streaming

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