tkbtkysms / solca

Related projects ⓘ

Alternatives and complementary repositories for solca

• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆11Updated 2 years ago
• kg86 / lzd
  LZ Double factor Factorization.
  ☆11Updated 7 years ago
• itomomoti / OnlineRlbwt
  Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.
  ☆14Updated 6 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 last year
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 3 years ago
• jermp / clustered_elias_fano_indexes
  Clustered Elias-Fano inverted indexes.
  ☆14Updated 6 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆20Updated 4 years ago
• tudocomp / tudocomp
  TU DOrtmund lossless COMPression framework
  ☆17Updated 2 months ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆55Updated last year
• maropu / integer_encoding_library
  An encoder/decoder collection for a sequence of integers
  ☆32Updated 11 years ago
• jermp / s_indexes
  Universe-sliced indexes in C++.
  ☆17Updated last year
• tudocomp / compact_sparse_hash
  A blend of the compact and sparse hash table implementations.
  ☆12Updated 3 years ago
• koeppl / separate_chaining
  Hash table with separate chaining layout
  ☆9Updated 3 years ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆45Updated 2 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆25Updated 5 years ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆98Updated 2 years ago
• KWillets / simd_interleave
  Interleaving bits from two sources using SIMD instructions.
  ☆14Updated 6 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆61Updated 5 months ago
• efficient / fast-succinct-trie
  ☆25Updated 7 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆40Updated 4 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆52Updated 10 months ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆51Updated 7 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 13 years ago
• simongog / surf
  SUccinct Retrieval Framework
  ☆19Updated 8 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆28Updated last year
• kampersanda / poplar-trie
  C++17 implementation of memory-efficient dynamic tries
  ☆57Updated 2 years ago
• waYne1337 / gsaca
  linear time suffix array construction algorithm
  ☆12Updated 8 years ago
• aboffa / CoCo-trie
  COllapsed and COmpressed trie: a data-aware compressed string dictionary
  ☆33Updated 11 months ago