<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>On Occupancy Moments and Bloom Filter Efficiency · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1908.04810/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1908.04810/feed.xml" rel="self" type="application/rss+xml" /><item><title>On Occupancy Moments and Bloom Filter Efficiency — mentioned by FreakLegion</title><link>https://news.ycombinator.com/item?id=23947507</link><guid isPermaLink="false">urn:hackerpapers:mention:1908.04810:23947507</guid><pubDate>Sat, 25 Jul 2020 07:51:00 GMT</pubDate><description>&lt;p&gt;For Bloom filters specifically I preferred last year&amp;#x27;s &amp;quot;On Occupancy Moments and Bloom Filter Efficiency&amp;quot;. You wouldn&amp;#x27;t guess from the title or abstract, but it&amp;#x27;s fairly comprehensive, including proofs of the expected false positive rates. https://arxiv.org/abs/1908.04810&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1908.04810/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.CO</category></item></channel></rss>
