Alternatives and similar repositories for parallel-radix-sort:

Users that are interested in parallel-radix-sort are comparing it to the libraries listed below

• iwiwi / parallel-string-radix-sort
  A parallelized implementation of optimized MSD radix sort for strings
  ☆27Updated 6 years ago
• iwiwi / radix-heap
  An implementation of radix heap
  ☆62Updated 9 years ago
• yamasa / lockfree
  Experimental implementations of lock-free algorithms, using hazard pointers and tagged pointers.
  ☆31Updated 13 years ago
• kampersanda / poplar-trie
  C++17 implementation of memory-efficient dynamic tries
  ☆58Updated 3 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆105Updated 7 years ago
• iskana / PBWT-sec
  ☆13Updated 5 years ago
• tanakamura / instruction-bench
  instruction-bench
  ☆36Updated 2 years ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 7 years ago
• kampersanda / xcdat
  Fast compressed trie dictionary library
  ☆67Updated 5 months ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆98Updated 2 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• fclaude / libcds
  Compact Data Structures Library
  ☆124Updated 10 years ago
• lpha-z / ltmpc
  C++11TMP compile time C compiler
  ☆27Updated 7 years ago
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆11Updated 2 years ago
• iwiwi / minimal-perfect-hash
  An implementation of minimal perfect hash function
  ☆18Updated 14 years ago
• bingmann / parallel-string-sorting
  Collection of Parallel String Sorting Algorithms including Parallel Super Scalar String Sample Sort and Parallel Multiway LCP-Mergesort
  ☆32Updated last year
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• 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 …
  ☆26Updated 2 years ago
• TokusiN / SuperSort
  Sort function at 5 to 7 times faster than std :: sort
  ☆15Updated 5 years ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆53Updated 5 years ago
• voutcn / kxsort
  Fast in-place radix sort with STL-like API
  ☆46Updated 8 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 5 months ago
• primitiv / primitiv-rust
  Rust binding of primitiv
  ☆20Updated 6 years ago
• herumi / cybozulib
  a tiny library for C++
  ☆65Updated 8 months ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆68Updated 7 years ago
• WojciechMula / sse-popcount
  SIMD (SSE) population count --- http://0x80.pl/articles/sse-popcount.html
  ☆335Updated 10 months ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆52Updated 7 years ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆52Updated 7 years ago
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆64Updated last year
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆76Updated 6 years ago