oertl | Dark Hacker News

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