Zero-One Laws for Sliding Windows and Universal Sketches

DOI10.4230/LIPIcs.APPROX-RANDOM.2015.573zbMath1375.68050OpenAlexW2287950946MaRDI QIDQ5351923

Rafail Ostrovsky, Alan Roytman, Vladimir Braverman

Publication date: 31 August 2017

Full work available at URL: https://doi.org/10.4230/lipics.approx-random.2015.573

zbMATH Keywords

universalitystreaming algorithmssliding windows

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (4)

Symmetric norm estimation and regression on sliding windows ⋮ Unnamed Item ⋮ Continuous Monitoring of l_p Norms in Data Streams ⋮ Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows.

This page was built for publication: Zero-One Laws for Sliding Windows and Universal Sketches