Alternatives and similar repositories for SorterHunter

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

• ips4o / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆120Updated 4 months ago
• imneme / bounded-rands
  Methods and Benchmarks for Random Numbers in a Range
  ☆37Updated 6 years ago
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆60Updated 4 years ago
• dragontamer / AESRand
  Random Number Generator based on hardware-accelerated AES instructions
  ☆57Updated 6 years ago
• backtrace-labs / umash
  UMASH: a fast enough hash and fingerprint with collision bounds
  ☆155Updated 4 months ago
• rutgers-apl / rlibm-32
  RLibm for 32-bit representations (float and posit32)
  ☆61Updated 3 years ago
• lemire / fastrange
  A fast alternative to the modulo reduction
  ☆308Updated 4 years ago
• eloj / radix-sorting
  Radix sorting from the ground up
  ☆36Updated last year
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆78Updated 3 years ago
• zwegner / zp7
  ZP7: Zach's Peppy Parallel-Prefix-Popcountin' PEXT/PDEP Polyfill
  ☆53Updated 9 months ago
• rutgers-apl / The-RLIBM-Project
  A combined repository for all RLIBM prototypes
  ☆45Updated 8 months ago
• IlyaGrebnov / libsais
  The libsais library provides fast linear-time construction of suffix array (SA), generalized suffix array (GSA), longest common prefix (L…
  ☆210Updated 3 weeks ago
• jix / sortnetopt
  Lower Size Bounds for Sorting Networks
  ☆45Updated 4 years ago
• minotaur-toolkit / minotaur
  A description of Minotaur can be found in https://arxiv.org/abs/2306.00229.
  ☆105Updated 10 months ago
• powturbo / Turbo-Histogram
  Fastest Histogram Construction
  ☆70Updated 3 years ago
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆44Updated 2 weeks ago
• slothy-optimizer / slothy
  Assembly super-optimization via constraint solving
  ☆191Updated this week
• orlp / polymur-hash
  The PolymurHash universal hash function.
  ☆351Updated last year
• lemire / SIMDxorshift
  Fast random number generators: Vectorized (SIMD) version of xorshift128+
  ☆115Updated 4 years ago
• IlyaGrebnov / libcubwt
  libcubwt is a library for GPU accelerated suffix array and burrows wheeler transform construction.
  ☆36Updated 3 weeks ago
• petersn / autosat
  Library for creation of SAT instances.
  ☆21Updated 2 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆88Updated 7 months ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 years ago
• danielcota / biski64
  A very fast and robust 64-bit PRNG with a 2^64 period.
  ☆107Updated last week
• veluca93 / fpnge
  Demo of a fast PNG encoder.
  ☆97Updated 4 months ago
• corsix / fast-crc32
  Fast CRC32 implementations
  ☆78Updated last year
• lemire / despacer
  C library to remove white space from strings as fast as possible
  ☆152Updated 8 months ago
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆84Updated last year
• awesome-simd / awesome-simd
  A curated list of awesome SIMD frameworks, libraries and software
  ☆185Updated 8 months ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago