oertl's submissions | Hacker News

1.		Techniques to beat Arrays.hashCode(byte[]) using Java's own means (dynatrace.com)
		13 points by oertl on July 6, 2025 \| past
2.		ExaLogLog: Approximate distinct counting with 43% less space than HyperLogLog (arxiv.org)
		3 points by oertl on March 14, 2024 \| past \| 1 comment
3.		UltraLogLog: A more space-efficient alternative to HyperLogLog
		1 point by oertl on June 10, 2022 \| past
4.		Dynatrace Hash Library for Java (github.com/dynatrace-oss)
		2 points by oertl on May 16, 2022 \| past
5.		SetSketch: Filling the Gap Between MinHash and HyperLogLog (arxiv.org)
		2 points by oertl on Jan 11, 2021 \| past
6.		DynaHist: A Dynamic Histogram Library for Java (github.com/dynatrace-oss)
		1 point by oertl on Sept 20, 2020 \| past
7.		Fast Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity (arxiv.org)
		2 points by oertl on Nov 6, 2019 \| past