Hacker News new | ask | show | jobs
user: oertl
created: 2016-12-22
karma: 16

submissions:

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