justinasvd / art_map

Related projects: ⓘ

• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆46Updated 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.
  ☆25Updated 2 weeks ago
• cuckoo-trie / cuckoo-trie-code
  ☆50Updated 4 months ago
• gmarcais / compact_vector
  Bit packed vector of integral values
  ☆25Updated last year
• amplab / succinct-cpp
  Succinct C++
  ☆24Updated 4 years ago
• attractivechaos / udb3
  ☆14Updated 3 months ago
• roberto-trani / mphf_benchmark
  A Benchmark of Minimal Perfect Hash Function Algorithms.
  ☆30Updated last year
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 7 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆40Updated 2 weeks ago
• rchikhi / benchmphf
  Benchmark of four minimal perfect hash libraries (phf, emphf, CMPH, Sux4J)
  ☆13Updated 7 years ago
• ByteHamster / SicHash
  A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.
  ☆14Updated last week
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 3 years ago
• ips4o / ips2ra
  In-place Parallel Super Scalar Radix Sort (IPS²Ra)
  ☆29Updated 6 months ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆52Updated 4 years ago
• kurpicz / pwm
  Parallel Wavelet Tree and Wavelet Matrix Construction
  ☆26Updated last year
• bhavanajain / concurrent-priority-queues
  Implemented Concurrent Priority Queues using fine grained locking over sequential heap and lockfree skiplist-based
  ☆9Updated 6 years ago
• llersch / cpp_random_distributions
  Additional C++11 Random Distributions
  ☆17Updated 3 months ago
• refresh-bio / RADULS
  Ultra fast MSD radix sorter
  ☆11Updated 4 years ago
• voutcn / kxsort
  Fast in-place radix sort with STL-like API
  ☆44Updated 7 years ago
• caetanosauer / fineline-zero
  ☆12Updated 5 years ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆48Updated 3 years ago
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆20Updated 2 weeks ago
• dominikkempa / zip-tree
  C++ Implementation of Zip Trees
  ☆13Updated last year
• jermp / lphash
  Fast and compact locality-preserving minimal perfect hashing for k-mer sets.
  ☆42Updated 10 months ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆102Updated 6 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated last year
• L-v-M / async
  ☆20Updated last year
• attractivechaos / udb2
  For details, see the blog post:
  ☆31Updated 9 months 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
• gaurav16gupta / RAMBO_MSMT
  ☆11Updated last year