Succinct summing over sliding windows

DOI10.1007/s00453-018-0524-4zbMath1421.68195OpenAlexW2899061597WikidataQ129002179 ScholiaQ129002179MaRDI QIDQ1741865

Yaron Kassner, Gil Einziger, Roy Friedman, Ran Ben-Basat

Publication date: 7 May 2019

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-018-0524-4

zbMATH Keywords

countingsliding windowapproximate countingadditive approximationbasic summing

Mathematics Subject Classification ID

Data structures (68P05) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Related Items (1)

Derandomization for sliding window algorithms with strict correctness

Cites Work

• Distributed streams algorithms for sliding windows
• How to catch \(L_2\)-heavy-hitters on sliding windows
• Longest increasing subsequences in sliding windows
• Dynamic Graphs in the Sliding-Window Model
• Sliding Bloom Filters
• Maintaining significant stream statistics over sliding windows
• Maintaining Stream Statistics over Sliding Windows
• Time- and Space-Efficient Sliding Window Top-k Query Processing
• Efficient Summing over Sliding Windows
• Finding Heavy Hitters over the Sliding Window of a Weighted Data Stream
• Maintaining time-decaying stream aggregates
• Unnamed Item

This page was built for publication: Succinct summing over sliding windows