HN Explorer

oertl

↗ HN profile [ 27.0 ms ] full profile

No user record in our sample, but oertl has activity below (stories or comments). Likely we have partial data — the full bulk-load will fill profiles in.

  1. Techniques to beat Arrays.hashCode(byte[]) using Java's own means (dynatrace.com)
    13 points 1
  2. ExaLogLog: Approximate distinct counting with 43% less space than HyperLogLog (arxiv.org)
    3 points 1
  3. Dynatrace Hash Library for Java (github.com)
    2 points 0
  4. SetSketch: Filling the Gap Between MinHash and HyperLogLog (arxiv.org)
    2 points 0
  5. DynaHist: A Dynamic Histogram Library for Java (github.com)
    1 points 0
  6. Fast Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity (arxiv.org)
    2 points 0