Invertible Bloom Lookup Tables with Less Memory and Randomness · HackerPapers discussionshttps://hackerpaper.kaipfister.de/p/2306.07583/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:27:26 GMTInvertible Bloom Lookup Tables with Less Memory and Randomness — HN submissionhttps://news.ycombinator.com/item?id=36704581urn:hackerpapers:submission:2306.07583:36704581Thu, 13 Jul 2023 03:08:57 GMT<p>Invertible Bloom Lookup Tables with Less Randomness and Memory</p><p></p><p>79 points; 56 discussion replies on HN. <a href="https://hackerpaper.kaipfister.de/p/2306.07583/">Paper and source history</a>. A submission is not an endorsement.</p>cs.DS