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)
  ☆127Updated 9 months ago
• zwegner / zp7
  ZP7: Zach's Peppy Parallel-Prefix-Popcountin' PEXT/PDEP Polyfill
  ☆56Updated last year
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆78Updated 3 years ago
• minotaur-toolkit / minotaur
  A description of Minotaur can be found in https://arxiv.org/abs/2306.00229.
  ☆112Updated last month
• backtrace-labs / umash
  UMASH: a fast enough hash and fingerprint with collision bounds
  ☆157Updated 2 months ago
• lemire / testingRNG
  Testing common random-number generators (RNG)
  ☆190Updated 2 years ago
• WojciechMula / toys
  Storage for my snippets, toy programs, etc.
  ☆367Updated 7 months ago
• slothy-optimizer / slothy
  Assembly super-optimization via constraint solving
  ☆223Updated last week
• orlp / polymur-hash
  The PolymurHash universal hash function.
  ☆358Updated 2 years ago
• IlyaGrebnov / libsais
  The libsais library provides fast linear-time construction of suffix array (SA), generalized suffix array (GSA), longest common prefix (L…
  ☆223Updated last month
• danielcota / biski64
  A very fast and robust 64-bit PRNG with a minimum 2^64 period.
  ☆148Updated 4 months ago
• eloj / radix-sorting
  Radix sorting from the ground up
  ☆37Updated last year
• petersn / autosat
  Library for creation of SAT instances.
  ☆23Updated 3 years ago
• gerben-s / quicksort-blog-post
  ☆39Updated 4 years ago
• dragontamer / AESRand
  Random Number Generator based on hardware-accelerated AES instructions
  ☆60Updated 6 years ago
• abolz / Drachennest
  Different algorithms for converting binary to decimal floating-point numbers
  ☆124Updated 3 years ago
• scandum / rotate
  A collection of array rotation algorithms.
  ☆159Updated 2 years ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆83Updated 6 years ago
• lemire / SIMDxorshift
  Fast random number generators: Vectorized (SIMD) version of xorshift128+
  ☆119Updated 5 years ago
• billziss-gh / imap
  Integer Map Data Structure
  ☆131Updated 2 years ago
• imneme / bounded-rands
  Methods and Benchmarks for Random Numbers in a Range
  ☆37Updated 7 years ago
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆62Updated 4 years ago
• richgel999 / sserangecoding
  Fast vectorized (SSE 4.1) range coder for 8-bit alphabets
  ☆26Updated 2 years ago
• senderista / hashtable-benchmarks
  An Evaluation of Linear Probing Hashtable Algorithms
  ☆32Updated last year
• komrad36 / SortingNetworks
  Fastest CPU SIMD (SSE4) sorting networks for small integer arrays (2-6 elements), also optimal amd64 assembly and notes on getting compil…
  ☆50Updated 4 years ago
• amd / aocl-libm-ose
  AOCL-LibM
  ☆121Updated last month
• smart-tool / smart
  String Matching Algorithms Research Tool
  ☆107Updated last year
• oschonrock / binfuse
  c++ library for binary fuse filters, including a sharded filter
  ☆94Updated 8 months ago
• ForwardCom / manual
  Reference manual for ForwardCom instruction set and software standards
  ☆170Updated 9 months ago
• lemire / fastrange
  A fast alternative to the modulo reduction
  ☆313Updated 4 years ago