scientific article; zbMATH DE number 2019620

zbMATH Open1028.68949MaRDI QIDQ4440423FDOQ4440423

T. S. Jayram, Ravi Kumar, Ziv Bar-Yossef, D. Sivakumar, Luca Trevisan

Publication date: 17 December 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2483/24830001.htm

Title of this publication is not available (Why is that?)

Recommendations

• Algorithms and Computation
• Range‐Efficient Counting of Distinct Elements in a Massive Data Stream
• Counting distinct items over update streams
• Probabilistic counting algorithms for data base applications
• Optimal streaming and tracking distinct elements with high probability

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Cited In (33)

• Title not available (Why is that?)
• Chebyshev polynomials, moment matching, and optimal estimation of the unseen
• Arthur-Merlin streaming complexity
• Probabilistic counting algorithms for data base applications
• Title not available (Why is that?)
• Robust lower bounds for communication and stream computation
• A Note on Estimating Hybrid Frequency Moment of Data Streams
• Data Stream Algorithms via Expander Graphs
• Estimating hybrid frequency moments of data streams
• Counting distinct items over update streams
• A statistical analysis of probabilistic counting algorithms
• Better size estimation for sparse matrix products
• Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams.
• Spatially-decaying aggregation over a network
• How to catch \(L_2\)-heavy-hitters on sliding windows
• Range‐Efficient Counting of Distinct Elements in a Massive Data Stream
• Revisiting maximum satisfiability and related problems in data streams
• Streaming techniques and data aggregation in networks of tiny artefacts
• Give me some slack: efficient network measurements
• Two improved range-efficient algorithms for \(F_0\) estimation
• Model counting meets \(F_0\) estimation
• A second look at counting triangles in graph streams
• Order statistics and estimating cardinalities of massive data sets
• Space-Efficient Straggler Identification in Round-Trip Data Streams Via Newton’s Identities and Invertible Bloom Filters
• Boosting distinct random sampling for basic counting on the union of distributed streams
• Exponential time improvement for min-wise based algorithms
• Title not available (Why is that?)
• Spiking neural networks through the lens of streaming algorithms
• Adversarially robust streaming algorithms via differential privacy
• Sample complexity of the distinct elements problem
• An improved data stream summary: the count-min sketch and its applications
• Approximate set union via approximate randomization
• Approximate set union via approximate randomization

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)