Space-Efficient

• Succinct Data Structure

  Data structures using near-optimal space (information-theoretic bounds) while maintaining efficient operations; compress without decompressing.

• Bloom Filter

  Probabilistic set membership test; extremely space-efficient with no false negatives but small false positive rate.