Srinivasa Rao Satti

Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets (2007)

Raman, Rajeev, Raman, Venkatesh, Satti, Srinivasa Rao

We consider the {\it indexable dictionary} problem, which consists of storing a set $S \subseteq \{0,...,m-1\}$ for some integer $m$, while supporting the operations of $\Rank(x)$, which returns the...