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