More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries

Abstract. We consider the problem of representing, in a compressed format, a bitvector S of m bits with n 1s, supporting the following operations, where b ∈ {0, 1}:

• Type: Conference
• Year: 2009
• Where: STACS
• Authors: Roberto Grossi, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao
• Keywords: Compressed Format, STACS 2009, Theoretical Computer Science