<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Dynamic Space Efficient Hashing · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1705.00997/</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/1705.00997/feed.xml" rel="self" type="application/rss+xml" /><item><title>Dynamic Space Efficient Hashing — mentioned by lorenzhs</title><link>https://news.ycombinator.com/item?id=14298501</link><guid isPermaLink="false">urn:hackerpapers:mention:1705.00997:14298501</guid><pubDate>Tue, 09 May 2017 08:31:53 GMT</pubDate><description>&lt;p&gt;If you&amp;#x27;re interested in truly space-efficient hash tables—as in &amp;quot;at every point in time, at least 97% of the space of the table is used for elements&amp;quot;—check out this paper by a colleague of mine: https://arxiv.org/pdf/1705.00997.pdf (the relevant plots are on pages 10 and 11). He&amp;#x27;s going to publish the code soon-ish as well.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1705.00997/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item></channel></rss>
