https://hackerpaper.kaipfister.de/p/1805.11255/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=43283971urn:hackerpapers:mention:1805.11255:43283971Thu, 06 Mar 2025 19:10:02 GMT<p>Note that succinct data structures may not be faster than conventional structures if your dataset fits in memory http://www.cs.cmu.edu/~huanche1/slides/FST.pdf . Of course, for large datasets where storage access times dominate, succinct data structures win all around. In any case, succinct trees are works of art (If I recall https://arxiv.org/pdf/1805.11255 was a good exposition) (just look at how that RMQ works)!</p><p><a href="https://hackerpaper.kaipfister.de/p/1805.11255/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.DS