Alternatives and similar repositories for kxsort

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

• rizkg / BBHash
  Bloom-filter based minimal perfect hash function library
  ☆274Updated 6 months ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 8 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆46Updated last year
• tlk00 / BitMagic
  BitMagic Library
  ☆442Updated 5 months ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 6 years ago
• jermp / pthash
  ✈️ PTHash is a fast and compact minimal perfect hash function.
  ☆250Updated 3 months ago
• dominikkempa / zip-tree
  C++ Implementation of Zip Trees
  ☆14Updated 3 years ago
• kimwalisch / libpopcnt
  🚀 Fast C/C++ bit population count library
  ☆360Updated last year
• roberto-trani / mphf_benchmark
  A Benchmark of Minimal Perfect Hash Function Algorithms.
  ☆38Updated 3 years ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆55Updated 6 years ago
• eloj / radix-sorting
  Radix sorting from the ground up
  ☆38Updated 2 years ago
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆289Updated 5 months ago
• lemire / SIMDxorshift
  Fast random number generators: Vectorized (SIMD) version of xorshift128+
  ☆123Updated 5 years ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆87Updated last month
• SaschaWitt / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆166Updated last year
• Tessil / array-hash
  C++ implementation of a fast and memory efficient hash map and hash set specialized for strings
  ☆185Updated 3 months ago
• kampersanda / poplar-trie
  C++17 implementation of memory-efficient dynamic tries
  ☆58Updated 3 years ago
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 5 years ago
• fast-pack / FrameOfReference
  C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference
  ☆54Updated last year
• ips4o / ips2ra
  In-place Parallel Super Scalar Radix Sort (IPS²Ra)
  ☆35Updated last year
• PatwinchIR / ultra-sort
  DSL for SIMD Sorting on AVX2 & AVX512
  ☆31Updated 7 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆66Updated last year
• WojciechMula / sse4-strstr
  SIMD (SWAR/SSE/SSE4/AVX2/AVX512F/ARM Neon) of Karp-Rabin algorithm's modification
  ☆261Updated 4 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆35Updated 2 years ago
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆68Updated 2 years ago
• martinus / map_benchmark
  Comprehensive benchmarks of C++ maps
  ☆316Updated 2 years ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆52Updated 8 years ago
• lemire / fastrange
  A fast alternative to the modulo reduction
  ☆317Updated 4 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
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆63Updated 4 years ago