<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>SIMD Compression and the Intersection of Sorted Integers · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1401.6399/</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/1401.6399/feed.xml" rel="self" type="application/rss+xml" /><item><title>SIMD Compression and the Intersection of Sorted Integers — mentioned by nkurz</title><link>https://news.ycombinator.com/item?id=7177349</link><guid isPermaLink="false">urn:hackerpapers:mention:1401.6399:7177349</guid><pubDate>Tue, 04 Feb 2014 13:55:50 GMT</pubDate><description>&lt;p&gt;Thanks, I&amp;#x27;ll check this out. I&amp;#x27;m very interested in x64 SIMD. This is the sort of thing I&amp;#x27;ve been doing with it: http://arxiv.org/abs/1401.6399 Although I&amp;#x27;m talking up Intel&amp;#x27;s compiler, and do think it usually beats GCC, my actual experience is that I&amp;#x27;ve largely given up on writing anything performant in C (muchless C++). If you give a compiler an inch, it will figure out way to hang itself. I&amp;#x27;m having much better luck doing the whole function with inline assembly rather than instinsics.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1401.6399/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.IR</category></item></channel></rss>
