Two improved range-efficient algorithms for F₀ estimation
From MaRDI portal
Publication:1007249
DOI10.1016/J.TCS.2008.10.031zbMATH Open1162.68041OpenAlexW2111918334MaRDI QIDQ1007249FDOQ1007249
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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The space complexity of approximating the frequency moments
- New hash functions and their use in authentication and set equality
- Probabilistic counting algorithms for data base applications
- Algorithms - ESA 2003
- Algorithms - ESA 2003
Cited In (2)
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)