https://hackerpaper.kaipfister.de/p/2402.13726/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=40397596urn:hackerpapers:mention:2402.13726:40397596Sat, 18 May 2024 09:22:58 GMT<p>The algorithm is simple, which is why it is also suitable for textbooks. However, it is far from representing the state of the art. In case you are interested in the latest development, I have recently published a new distinct counting algorithm where the estimate does not depend on the processing order, which can be merged and requires only 3.5kB of memory to guarantee a standard error of 1.13% for counts up to exa-scale: https://arxiv.org/abs/2402.13726</p><p><a href="https://hackerpaper.kaipfister.de/p/2402.13726/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.DShttps://news.ycombinator.com/item?id=39701867urn:hackerpapers:submission:2402.13726:39701867Thu, 14 Mar 2024 09:29:40 GMT<p>ExaLogLog: Approximate distinct counting with 43% less space than HyperLogLog</p><p></p><p>3 points; 1 discussion reply on HN. <a href="https://hackerpaper.kaipfister.de/p/2402.13726/">Paper and source history</a>. A submission is not an endorsement.</p>cs.DS