<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>A Fast x86 Implementation of Select · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1706.00990/</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/1706.00990/feed.xml" rel="self" type="application/rss+xml" /><item><title>A Fast x86 Implementation of Select — mentioned by judofyr</title><link>https://news.ycombinator.com/item?id=43284086</link><guid isPermaLink="false">urn:hackerpapers:mention:1706.00990:43284086</guid><pubDate>Thu, 06 Mar 2025 19:19:49 GMT</pubDate><description>&lt;p&gt;I can speak a bit about one of the approaches: &amp;quot;Practical Entropy-Compressed Rank/Select Dictionary&amp;quot; by Daisuke Okanohara and Kunihiko Sadakane. This presents two different variants: One for dense (i.e. more than 50% of the bits are set) and one for sparse. The dense implementation is basically based around partitioning them into &amp;quot;blocks&amp;quot; of a given size and then you can find the block by doing `block[idx / block_size]`. It then also groups each block into sub-blocks which helps you even further. All of these are additional data structures (very much like an index) which are stored next to…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1706.00990/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item><item><title>A Fast x86 Implementation of Select — mentioned by Bayart</title><link>https://news.ycombinator.com/item?id=27478104</link><guid isPermaLink="false">urn:hackerpapers:mention:1706.00990:27478104</guid><pubDate>Fri, 11 Jun 2021 20:32:09 GMT</pubDate><description>&lt;p&gt;The paper, if anyone wants to save some clicks : https://arxiv.org/abs/1706.00990&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1706.00990/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item><item><title>A Fast x86 Implementation of Select — mentioned by dgacmu</title><link>https://news.ycombinator.com/item?id=23293522</link><guid isPermaLink="false">urn:hackerpapers:mention:1706.00990:23293522</guid><pubDate>Sun, 24 May 2020 18:33:23 GMT</pubDate><description>&lt;p&gt;This paper was first published in 2008 (and has since been beaten several times over by more modern techniques). a quick glance doesn&amp;#x27;t suggest that there&amp;#x27;s anything obviously new in this version, is there a reason it has a new date? Original: https://dl.acm.org/doi/10.5555/1788888.1788900 to those curious about this area, one of the most recent and fastest results is this one from pandey et al: https://arxiv.org/abs/1706.00990&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1706.00990/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item><item><title>A Fast x86 Implementation of Select — HN submission</title><link>https://news.ycombinator.com/item?id=18210599</link><guid isPermaLink="false">urn:hackerpapers:submission:1706.00990:18210599</guid><pubDate>Sat, 13 Oct 2018 23:44:53 GMT</pubDate><description>&lt;p&gt;A Fast x86 Implementation of Select (2017) [pdf]&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;90 points; 18 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1706.00990/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item><item><title>A Fast x86 Implementation of Select — HN submission</title><link>https://news.ycombinator.com/item?id=14504534</link><guid isPermaLink="false">urn:hackerpapers:submission:1706.00990:14504534</guid><pubDate>Wed, 07 Jun 2017 08:21:18 GMT</pubDate><description>&lt;p&gt;A Fast X86 Implementation of Select&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;3 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1706.00990/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item></channel></rss>
