Alternatives and similar repositories for ips2ra:

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

• refresh-bio / RADULS
  Ultra fast MSD radix sorter
  ☆11Updated 4 years ago
• ips4o / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆118Updated 2 months ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 7 months ago
• TooBiased / DySECT
  Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.
  ☆20Updated 2 years ago
• roberto-trani / mphf_benchmark
  A Benchmark of Minimal Perfect Hash Function Algorithms.
  ☆35Updated 2 years ago
• ByteHamster / SicHash
  A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.
  ☆19Updated last week
• voutcn / kxsort
  Fast in-place radix sort with STL-like API
  ☆46Updated 8 years ago
• dominikkempa / faster-minuter
  Wavelet tree based on a fixed block boosting technique
  ☆16Updated 3 years ago
• kurpicz / pwm
  Parallel Wavelet Tree and Wavelet Matrix Construction
  ☆26Updated last year
• SaschaWitt / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆161Updated 2 months ago
• nicolaprezza / Re-Pair
  A space-efficient compressor based on the Re-Pair grammar
  ☆11Updated 8 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆53Updated 10 months ago
• dominikkempa / zip-tree
  C++ Implementation of Zip Trees
  ☆14Updated 2 years ago
• TooBiased / growt
  This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…
  ☆109Updated 3 months ago
• stxxl / foxxll
  FOundation of stXXl and thriLL
  ☆14Updated last year
• xxsds / sdsl-lite
  Succinct Data Structure Library 3.0
  ☆94Updated this week
• itomomoti / OnlineRlbwt
  Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.
  ☆15Updated 6 years ago
• nicolaprezza / r-index
  An optimal space run-length Burrows-Wheeler transform full-text index
  ☆62Updated last year
• koeppl / stringsheet
  A cheatsheet for most common Stringology tasks
  ☆15Updated 3 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆105Updated 7 years ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 8 years ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆49Updated 3 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 4 months ago
• cwida / rma
  Sequential implementation of the Rewired Memory Array.
  ☆18Updated 5 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆43Updated this week
• sacabench / sacabench
  Implementation of the sacabench framework
  ☆16Updated 3 years ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated 10 months ago
• weissan / BlockQuicksort
  ☆34Updated 3 years ago
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 2 years ago