HyperLogLog
From MaRDI portal
Software:14608
swMATH2063MaRDI QIDQ14608FDOQ14608
Author name not available (Why is that?)
Cited In (20)
- Improving MinHash via the containment index with applications to metagenomic analysis
- Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows.
- Binary vectors for fast distance and similarity estimation
- A survey of challenges for runtime verification from advanced application domains (beyond software)
- Approximating the Size of a Radio Network in Beeping Model
- Fast Concurrent Data Sketches
- Index structures for fast similarity search for real-valued vectors. I
- Title not available (Why is that?)
- Give me some slack: efficient network measurements
- An analytic approach to the asymptotic variance of trie statistics and related structures
- Index structures for fast similarity search for binary vectors
- A unified scheme for generalizing cardinality estimators to sum aggregation
- Title not available (Why is that?)
- Order statistics and estimating cardinalities of massive data sets
- Fast size approximation of a radio network in beeping model
- When distributed computation is communication expensive
- Approximate Counting with a Floating-Point Counter
- Measuring the impact of MVC attack in large complex networks
- Title not available (Why is that?)
- I/O-efficient calculation of \(H\)-group closeness centrality over disk-resident graphs
This page was built for software: HyperLogLog
