Effective computations on sliding windows

DOI10.1137/090749281MaRDI QIDQ3068626zbMATH OpenOpenAlexFDO

Authors Vladimir Braverman, Rafail Ostrovsky

Publication date 17 January 2011

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/c26d8cc2f67722d00525ddf2f3f865db807738fd

zbMATH Keywords

data streamsrandomized algorithmssliding windowssmooth histograms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Recommendations

• Maintaining Stream Statistics over Sliding Windows
• scientific article; zbMATH DE number 2119721
• How to catch \(L _{2}\)-heavy-hitters on sliding windows
• Distributed streams algorithms for sliding windows
• New algorithms for distributed sliding windows

Cited in

(12)

• Succinct summing over sliding windows
• Almost-smooth histograms and sliding-window graph algorithms
• Optimal Random Sampling from Distributed Streams Revisited
• scientific article; zbMATH DE number 2086662 (Why is no real title available?)
• Maintaining Stream Statistics over Sliding Windows
• scientific article; zbMATH DE number 2119721 (Why is no real title available?)
• Nearly optimal distinct elements and heavy hitters on sliding windows
• New algorithms for distributed sliding windows
• Data-streams and histograms
• Efficient Summing over Sliding Windows
• scientific article; zbMATH DE number 7758337 (Why is no real title available?)
• A general method for estimating correlated aggregates over a data stream

This page was built for publication: Effective computations on sliding windows

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