Two improved range-efficient algorithms for F₀ estimation

DOI10.1016/J.TCS.2008.10.031zbMATH Open1162.68041OpenAlexW2111918334MaRDI QIDQ1007249FDOQ1007249

Authors: He Sun, Chung Keung Poon 

Publication date: 20 March 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.10.031

Recommendations

• Two Improved Range-Efficient Algorithms for F 0 Estimation
• Range‐Efficient Counting of Distinct Elements in a Massive Data Stream
• Optimal approximations of the frequency moments of data streams
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• scientific article; zbMATH DE number 2019620

zbMATH Keywords

data streams\(F_{0}\) normdistinct elementsrange-efficiency

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Data structures (68P05) Nonnumerical algorithms (68W05)

Cites Work

• The space complexity of approximating the frequency moments
• New hash functions and their use in authentication and set equality
• Data streams: algorithms and applications.
• Title not available (Why is that?)
• Probabilistic counting algorithms for data base applications
• Title not available (Why is that?)
• LogLog counting of large cardinalities (extended abstract)
• Algorithms - ESA 2003
• Order statistics and estimating cardinalities of massive data sets

Cited In (4)

• Two Improved Range-Efficient Algorithms for F 0 Estimation
• Estimating the range of a function in an online setting
• Efficient transformations for Klee's measure problem in the streaming model
• Model counting meets \(F_0\) estimation

This page was built for publication: Two improved range-efficient algorithms for \(F_0\) estimation

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