Effective computations on sliding windows

DOI10.1137/090749281zbMATH Open1207.68163OpenAlexW2019766199MaRDI QIDQ3068626FDOQ3068626

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

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

zbMATH Keywords

randomized algorithmssliding windowsdata streamssmooth histograms

Mathematics Subject Classification ID

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

Cited In (11)

• Title not available (Why is that?)
• Maintaining Stream Statistics over Sliding Windows
• A general method for estimating correlated aggregates over a data stream
• New algorithms for distributed sliding windows
• Nearly optimal distinct elements and heavy hitters on sliding windows
• Optimal Random Sampling from Distributed Streams Revisited
• Title not available (Why is that?)
• Title not available (Why is that?)
• Data-streams and histograms
• Efficient Summing over Sliding Windows
• Almost-smooth histograms and sliding-window graph algorithms

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)