Sampling in dynamic data streams and applications

DOI10.1145/1064092.1064116zbMath1380.68143OpenAlexW2095158239MaRDI QIDQ5370606

Christian Sohler, Gereon Frahling, Piotr Indyk

Publication date: 20 October 2017

Published in: Proceedings of the twenty-first annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1064092.1064116

zbMATH Keywords

data structurescomputational geometrystreaming algorithms

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Related Items (8)

Triangle counting in dynamic graph streams ⋮ Optimal sampling from sliding windows ⋮ Facility Location in Dynamic Geometric Data Streams ⋮ Weighted sampling without replacement from data streams ⋮ Dynamic graph stream algorithms in \(o(n)\) space ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Efficient sampling of non-strict turnstile data streams

This page was built for publication: Sampling in dynamic data streams and applications