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)
  ☆132Updated last year
• zwegner / zp7
  ZP7: Zach's Peppy Parallel-Prefix-Popcountin' PEXT/PDEP Polyfill
  ☆58Updated last year
• minotaur-toolkit / minotaur
  A description of Minotaur can be found in https://arxiv.org/abs/2306.00229.
  ☆125Updated last month
• petersn / autosat
  Library for creation of SAT instances.
  ☆23Updated 3 years ago
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆79Updated 4 years ago
• slothy-optimizer / slothy
  Assembly super-optimization via constraint solving
  ☆237Updated last week
• lemire / SIMDxorshift
  Fast random number generators: Vectorized (SIMD) version of xorshift128+
  ☆123Updated 5 years ago
• rutgers-apl / rlibm-32
  RLibm for 32-bit representations (float and posit32)
  ☆60Updated 4 years ago
• dragontamer / AESRand
  Random Number Generator based on hardware-accelerated AES instructions
  ☆61Updated 6 years ago
• lemire / testingRNG
  Testing common random-number generators (RNG)
  ☆198Updated last month
• scandum / rotate
  A collection of array rotation algorithms.
  ☆166Updated 3 years ago
• master-keying / minisat
  A minimalistic and high-performance SAT solver
  ☆147Updated 4 years ago
• ForwardCom / manual
  Reference manual for ForwardCom instruction set and software standards
  ☆173Updated last year
• abolz / Drachennest
  Different algorithms for converting binary to decimal floating-point numbers
  ☆129Updated 3 years ago
• WojciechMula / toys
  Storage for my snippets, toy programs, etc.
  ☆374Updated 3 months ago
• backtrace-labs / umash
  UMASH: a fast enough hash and fingerprint with collision bounds
  ☆159Updated last month
• taschini / crlibm
  A mirror of the CRLibm project from INRIA Forge
  ☆50Updated 5 years ago
• lemire / fastrange
  A fast alternative to the modulo reduction
  ☆317Updated 4 years ago
• Mysticial / ProtoNTT
  A basic implementation of the Small Primes Number-Theoretic Transform (NTT) multiplication algorithm.
  ☆24Updated 8 years ago
• danielcota / biski64
  A very fast and robust 64-bit PRNG with a minimum 2^64 period.
  ☆151Updated 8 months ago
• billziss-gh / imap
  Integer Map Data Structure
  ☆133Updated 2 years ago
• marcandrysco / Errol
  Binary floating-point to decimal string conversion algorithm.
  ☆106Updated 8 years ago
• IlyaGrebnov / libsais
  The libsais library provides fast linear-time construction of suffix array (SA), generalized suffix array (GSA), longest common prefix (L…
  ☆234Updated 5 months ago
• orlp / polymur-hash
  The PolymurHash universal hash function.
  ☆358Updated 2 years ago
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆63Updated 4 years ago
• aphitorite / Logsort
  O(n log n) In-place Stable Quicksort
  ☆22Updated 6 months ago
• skeeto / hash-prospector
  Automated integer hash function discovery
  ☆752Updated last year
• rutgers-apl / The-RLIBM-Project
  A combined repository for all RLIBM prototypes
  ☆47Updated last month
• veluca93 / fpnge
  Demo of a fast PNG encoder.
  ☆100Updated 4 months ago
• lemire / fastmod
  A C/C++ header file for fast 32-bit division remainders (and divisibility tests) on 64-bit hardware.
  ☆341Updated last year