= Roberto Grossi
{c}
<Roberto Grossi> coauthored the 2003 entropy-compressed text-index paper with <Ankur Gupta> and <Jeffrey Scott Vitter>. The paper combines compressed suffix-array techniques with a <wavelet tree>, routing <sequence> positions through <bit vector>[bitvectors] that partition the alphabet. Its indexing bounds relate stored space to empirical entropy while retaining <string-searching algorithm>[pattern-search] functionality. The mathematical aim is both compression and access, rather than simply making a <file> small.<High-Order Entropy-Compressed Text Indexes by Roberto Grossi and others>[abstract and §4.2]{ref}
Back to article page
