oertl
- Karma
- 16
- Created
- 9 years ago
Recent Submissions
- 1. ▲ Techniques to beat Arrays.hashCode(byte[]) using Java's own means (dynatrace.com)
- 2. ▲ ExaLogLog: Approximate distinct counting with 43% less space than HyperLogLog (arxiv.org)
- 3. ▲ UltraLogLog: A more space-efficient alternative to HyperLogLog
- 4. ▲ Dynatrace Hash Library for Java (github.com)
- 5. ▲ SetSketch: Filling the Gap Between MinHash and HyperLogLog (arxiv.org)
- 6. ▲ DynaHist: A Dynamic Histogram Library for Java (github.com)
- 7. ▲ Fast Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity (arxiv.org)