Alternatives and similar repositories for lzrr:

Users that are interested in lzrr are comparing it to the libraries listed below

• kg86 / lzd
  LZ Double factor Factorization.
  ☆11Updated 7 years ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 7 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• farruggia / bc-zip
  Bicriteria Data Compressor
  ☆14Updated 7 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆29Updated 2 years ago
• simongog / surf
  SUccinct Retrieval Framework
  ☆19Updated 9 years ago
• tudocomp / compact_sparse_hash
  A blend of the compact and sparse hash table implementations.
  ☆12Updated 3 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 5 months ago
• jermp / psds
  Efficient Prefix-Sum data structures in C++.
  ☆25Updated last year
• jermp / s_indexes
  Universe-sliced indexes in C++.
  ☆18Updated 2 years ago
• jermp / essentials
  Essential C++ utilities.
  ☆15Updated 8 months ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆55Updated 2 years ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 2 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆20Updated 4 years ago
• dominikkempa / zip-tree
  C++ Implementation of Zip Trees
  ☆14Updated 2 years ago
• kapenga / LittleBit
  LittleBit is a pure Huffman coding compression algorithm with the option of random access reading while offering competitive compression …
  ☆12Updated 3 years ago
• WojciechMula / simd-byte-lookup
  SIMDized check which bytes are in a set
  ☆28Updated 6 years ago
• richox / zmolly
  PPM compressor with high compression ratio.
  ☆32Updated 6 years ago
• koeppl / separate_chaining
  Hash table with separate chaining layout
  ☆9Updated 3 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• michaelmaniscalco / m99
  novel high throughput entropy encoder for BWT data
  ☆14Updated 2 years ago
• kampersanda / poplar-trie
  C++17 implementation of memory-efficient dynamic tries
  ☆58Updated 3 years ago
• tkbtkysms / solca
  A Space-Optimal Grammar Compression
  ☆10Updated 4 years ago
• kampersanda / cda-tries
  Compressed double-array tries for static string dictionaries
  ☆11Updated 5 years ago
• fclaude / libcds
  Compact Data Structures Library
  ☆124Updated 10 years ago
• splatlab / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆15Updated 6 years ago
• stew675 / Paired-Heap-Library
  Implementation of Paired Heaps for Priority Queues
  ☆8Updated 5 years ago
• waYne1337 / tbwt
  BWT tunneling
  ☆13Updated 7 years ago
• google / zuckerli
  ☆27Updated 2 years ago
• pasta-toolbox / bit_vector
  Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.
  ☆29Updated 3 months ago