scientific article; zbMATH DE number 2019620
From MaRDI portal
Publication:4440423
Recommendations
Cited in
(55)- Order statistics and estimating cardinalities of massive data sets
- Two improved range-efficient algorithms for \(F_0\) estimation
- Probabilistic counting algorithms for data base applications
- Chebyshev polynomials, moment matching, and optimal estimation of the unseen
- Sample complexity of the distinct elements problem
- Efficient exact algorithm for count distinct problem
- Give me some slack: efficient network measurements
- Arthur-Merlin streaming complexity
- Counting distinct items over update streams
- Robust lower bounds for communication and stream computation
- A statistical analysis of probabilistic counting algorithms
- Data streams as random permutations: the distinct element problem
- Distinct counting with a self-learning bitmap
- Testing properties of collections of distributions
- Data Stream Algorithms via Expander Graphs
- Space-Efficient Straggler Identification in Round-Trip Data Streams Via Newton’s Identities and Invertible Bloom Filters
- A Note on Estimating Hybrid Frequency Moment of Data Streams
- Estimating hybrid frequency moments of data streams
- scientific article; zbMATH DE number 2079346 (Why is no real title available?)
- Finding duplicates in a data stream
- Streaming techniques and data aggregation in networks of tiny artefacts
- An improved data stream summary: the count-min sketch and its applications
- Boosting distinct random sampling for basic counting on the union of distributed streams
- An improved interactive streaming algorithm for the distinct elements problem
- A framework for estimating stream expression cardinalities
- Range‐Efficient Counting of Distinct Elements in a Massive Data Stream
- Finding a Duplicate and a Missing Item in a Stream
- Two Improved Range-Efficient Algorithms for F 0 Estimation
- On the I/O complexity of dynamic distinct counting
- Algorithms and Computation
- Approximate set union via approximate randomization
- Approximate set union via approximate randomization
- Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams.
- scientific article; zbMATH DE number 7758337 (Why is no real title available?)
- Revisiting maximum satisfiability and related problems in data streams
- Spiking neural networks through the lens of streaming algorithms
- Model counting meets \(F_0\) estimation
- Adversarially robust streaming algorithms via differential privacy
- Derandomization with pseudorandomness
- Mean and covariance estimation of functional data streams
- Improved streaming algorithm for the Klee's measure problem and generalizations
- Deletions and dishonesty: probabilistic data structures in adversarial settings
- Cardinality estimation using Gumbel distribution
- Distinct elements in streams: an algorithm for the (text) book
- Exponential time improvement for min-wise based algorithms
- Maximum coverage in the data stream model: parameterized and generalized
- Efficient differentially private F₀ linear sketching
- Non-mergeable sketching for cardinality estimation
- Verification of the CVM algorithm with a functional probabilistic invariant
- Distributed Distinct Elements
- Formalization of Randomized Approximation Algorithms for Frequency Moments
- Median Method
- A second look at counting triangles in graph streams
- How to catch \(L_2\)-heavy-hitters on sliding windows
- Spatially-decaying aggregation over a network
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4440423)
