https://hackerpaper.kaipfister.de/p/1711.00275/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=20874705urn:hackerpapers:mention:1711.00275:20874705Wed, 04 Sep 2019 07:10:08 GMT<p>This is cool. I wanted to comment on the necessity of knowing the approximate size of N a priori, but this is very clearly stated on the github page. Interesting alternatives that also support insertion, deletion, and lookup (is there a name for this interface?) are AVL trees and hash tables. As described in https://arxiv.org/pdf/1711.00275.pdf, tiered vectors can be improved further: &quot;We present a highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(1) and insertion and deletion in time O(n^ε) for ε &gt; 0 while…</p><p><a href="https://hackerpaper.kaipfister.de/p/1711.00275/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.DS