Alternatives and similar repositories for ips2ra:

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

• ByteHamster / SicHash
  A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.
  ☆18Updated last month
• refresh-bio / RADULS
  Ultra fast MSD radix sorter
  ☆11Updated 4 years 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
• kurpicz / pwm
  Parallel Wavelet Tree and Wavelet Matrix Construction
  ☆26Updated last year
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 4 months ago
• ips4o / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆117Updated 2 weeks ago
• dominikkempa / zip-tree
  C++ Implementation of Zip Trees
  ☆14Updated 2 years ago
• roberto-trani / mphf_benchmark
  A Benchmark of Minimal Perfect Hash Function Algorithms.
  ☆35Updated 2 years ago
• dominikkempa / faster-minuter
  Wavelet tree based on a fixed block boosting technique
  ☆16Updated 3 years ago
• koeppl / stringsheet
  A cheatsheet for most common Stringology tasks
  ☆15Updated 3 years ago
• SaschaWitt / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆161Updated 2 weeks ago
• xxsds / sdsl-lite
  Succinct Data Structure Library 3.0
  ☆94Updated 4 months ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 7 years ago
• voutcn / kxsort
  Fast in-place radix sort with STL-like API
  ☆46Updated 8 years ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆53Updated 5 years ago
• nicolaprezza / r-index
  An optimal space run-length Burrows-Wheeler transform full-text index
  ☆61Updated last year
• PatwinchIR / ultra-sort
  DSL for SIMD Sorting on AVX2 & AVX512
  ☆30Updated 6 years ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆49Updated 3 years ago
• itomomoti / OnlineRlbwt
  Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.
  ☆15Updated 6 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…
  ☆107Updated last month
• jltsiren / bwt-merge
  A tool for merging large BWTs
  ☆26Updated 4 years ago
• nicolaprezza / Re-Pair
  A space-efficient compressor based on the Re-Pair grammar
  ☆11Updated 7 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
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆62Updated 8 months ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆105Updated 7 years ago
• stxxl / foxxll
  FOundation of stXXl and thriLL
  ☆14Updated last year
• 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 …
  ☆22Updated 2 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆52Updated 8 months ago
• weissan / BlockQuicksort
  ☆34Updated 3 years ago