HyperLogLog
From MaRDI portal
Cited in
(37)- Order statistics and estimating cardinalities of massive data sets
- Index structures for fast similarity search for real-valued vectors. I
- JGraphT
- A survey of challenges for runtime verification from advanced application domains (beyond software)
- Improving MinHash via the containment index with applications to metagenomic analysis
- Give me some slack: efficient network measurements
- Fast size approximation of a radio network in beeping model
- I/O-efficient calculation of H-group closeness centrality over disk-resident graphs
- Binary vectors for fast distance and similarity estimation
- ANF
- An analytic approach to the asymptotic variance of trie statistics and related structures
- FLANN
- Approximating the size of a radio network in beeping model
- Analysis of an algorithm catching elephants on the Internet
- An optimal cardinality estimation algorithm based on order statistics and its full analysis
- SoftDoubleMaxMinOver
- HLIO
- Approximate counting with a floating-point counter
- contractLarva
- GenBank
- sourmash
- deBGA
- SplitMEM
- GraphChi
- BioBloom Tools
- BLESS
- GemSIM
- A unified scheme for generalizing cardinality estimators to sum aggregation
- scientific article; zbMATH DE number 7370627 (Why is no real title available?)
- Nearly optimal distinct elements and heavy hitters on sliding windows
- Measuring the impact of MVC attack in large complex networks
- Fast Concurrent Data Sketches
- SprayList
- DataSketches
- PALISADE
- HumGut
- Index structures for fast similarity search for binary vectors
This page was built for software: HyperLogLog
