gvinciguerra / la_vector

Related projects ⓘ

Alternatives and complementary repositories for la_vector

• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated last year
• kurpicz / pwm
  Parallel Wavelet Tree and Wavelet Matrix Construction
  ☆26Updated last year
• pasta-toolbox / bit_vector
  Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.
  ☆26Updated 2 months ago
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆39Updated last month
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆28Updated last year
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆49Updated 3 years ago
• mpetri / recursive_graph_bisection
  This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…
  ☆10Updated 6 years ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆45Updated 2 years ago
• dominikkempa / zip-tree
  C++ Implementation of Zip Trees
  ☆13Updated 2 years ago
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 2 years ago
• nicola-gigante / bitvector
  A C++ container-like data structure for storing a vector of bits with fast appending on both sides and fast insertion in the middle, all …
  ☆21Updated 2 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆82Updated last month
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆23Updated 2 months ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆27Updated 3 years ago
• stxxl / foxxll
  FOundation of stXXl and thriLL
  ☆14Updated 9 months ago
• xxsds / sdsl-lite
  Succinct Data Structure Library 3.0
  ☆86Updated 2 months ago
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 3 years ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆111Updated 5 months ago
• aboffa / CoCo-trie
  COllapsed and COmpressed trie: a data-aware compressed string dictionary
  ☆33Updated 11 months ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆40Updated 4 years ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 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
• amplab / succinct-cpp
  Succinct C++
  ☆25Updated 4 years ago
• jermp / s_indexes
  Universe-sliced indexes in C++.
  ☆17Updated last year
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆55Updated last year
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆61Updated 5 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
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆11Updated 2 years ago
• patflick / psac
  Parallel Suffix Array, LCP Array, and Suffix Tree Construction
  ☆48Updated 5 years ago
• roberto-trani / mphf_benchmark
  A Benchmark of Minimal Perfect Hash Function Algorithms.
  ☆30Updated last year