Towards Optimal Moment Estimation in Streaming and Distributed Models

Cites Work

Title not available (Why is that?)
Turning big data into tiny data: constant-size coresets for \(k\)-means, PCA and projective clustering
Space-efficient estimation of statistics over sub-sampled streams
Optimal Random Sampling from Distributed Streams Revisited
Optimal approximations of the frequency moments of data streams
On the exact space complexity of sketching and streaming small norms
Fast moment estimation in data streams in optimal space
Data streams: algorithms and applications.
Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND
An information statistics approach to data stream and communication complexity
Approximate counting: a detailed analysis
Stable distributions, pseudorandom generators, embeddings, and data stream computation
Algorithms for distributed functional monitoring
Asymptotically optimal lower bounds on the NIH-multi-party information complexity of the AND-function and disjointness
The one-way communication complexity of Hamming distance
Pseudorandom generators for space-bounded computation
The Data Stream Space Complexity of Cascaded Norms
Optimal space lower bounds for all frequency moments
Sparser Johnson-Lindenstrauss transforms
Title not available (Why is that?)
An optimal lower bound on the communication complexity of gap-Hamming-distance
Univariate Stable Distributions
Counting large numbers of events in small registers
Streaming algorithms via precision sampling
Sketching as a tool for numerical linear algebra
Optimal tracking of distributed heavy hitters and quantiles
An optimal algorithm for large frequency moments using \(O(n^{1-2/k})\) bits
Relative errors for deterministic low-rank matrix approximations
Functional Monitoring without Monotonicity
Tight bounds for distributed functional monitoring
Tighter low-rank approximation via sampling the leveraged element
Randomized algorithms for tracking distributed count, frequencies, and ranks
Optimal principal component analysis in distributed and streaming models
Zero-one frequency laws
The Simultaneous Communication of Disjointness with Applications to Data Streams
Robust lower bounds for communication and stream computation
1-pass relative-error \(L_p\)-sampling with applications
Corrigendum to: ``A second look at counting triangles in graph streams
A near-optimal algorithm for estimating the entropy of a stream
A Tight Lower Bound for High Frequency Moment Estimation with Small Error
Compressed counting
Title not available (Why is that?)
Continuous Monitoring of l_p Norms in Data Streams

This page was built for publication: Towards Optimal Moment Estimation in Streaming and Distributed Models

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