<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>CONCISE: Compressed 'n' Composable Integer Set · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1004.0403/</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/1004.0403/feed.xml" rel="self" type="application/rss+xml" /><item><title>CONCISE: Compressed 'n' Composable Integer Set — mentioned by a1k0n</title><link>https://news.ycombinator.com/item?id=11183224</link><guid isPermaLink="false">urn:hackerpapers:mention:1004.0403:11183224</guid><pubDate>Fri, 26 Feb 2016 18:56:05 GMT</pubDate><description>&lt;p&gt;Check out Concise [0] or Roaring Bitmaps [1] before rolling your own compressed bitset scheme. Wish I had known about these sooner. (I realize now this is offtopic, as this is bit fields not bit sets; nevermind, but still it&amp;#x27;s interesting!) [0] http://arxiv.org/pdf/1004.0403.pdf [1] http://roaringbitmap.org/&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1004.0403/"&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>
