Resizable Retrieval

William Kuszmaul, Aaron Putterman, Tingqiang Xu +2

A dynamic retrieval data structure encodes a function $f:K\to [2^v]$ for a set $K\subseteq [U]$, while supporting queries $f(x)$ for $x\in K$, insertions \texttt{Insert}$…