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
• kampersanda / poplar-trie
  C++17 implementation of memory-efficient dynamic tries
  ☆58Updated 3 years ago
• iwiwi / radix-heap
  An implementation of radix heap
  ☆62Updated 9 years ago
• MitI-7 / WaveletMatrix
  implementation of dynamic wavelet matrix(tree) and static wavelet matrix
  ☆22Updated 5 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 6 months ago
• lpha-z / ltmpc
  C++11TMP compile time C compiler
  ☆27Updated 7 years ago
• yamasa / lockfree
  Experimental implementations of lock-free algorithms, using hazard pointers and tagged pointers.
  ☆31Updated 13 years ago
• tanakamura / instruction-bench
  instruction-bench
  ☆36Updated 2 years ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆98Updated 2 years ago
• onihusube / harmony
  C++ Monadologie
  ☆26Updated 3 years ago
• iskana / PBWT-sec
  ☆13Updated 5 years ago
• massivethreads / massivethreads
  Light weight thread library
  ☆66Updated 5 months ago
• loliGothicK / mitama-cpp-result
  A Library that provides `result<T, E>` and `maybe<T>` and monadic functions for them.
  ☆51Updated 2 months ago
• bingmann / parallel-string-sorting
  Collection of Parallel String Sorting Algorithms including Parallel Super Scalar String Sample Sort and Parallel Multiway LCP-Mergesort
  ☆33Updated last year
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated 10 months ago
• kampersanda / xcdat
  Fast compressed trie dictionary library
  ☆68Updated 6 months ago
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆11Updated 2 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• herumi / cybozulib
  a tiny library for C++
  ☆65Updated 9 months ago
• voutcn / kxsort
  Fast in-place radix sort with STL-like API
  ☆46Updated 8 years ago
• hillbig / tx-trie
  Automatically exported from code.google.com/p/tx-trie
  ☆29Updated 9 years ago
• iwiwi / minimal-perfect-hash
  An implementation of minimal perfect hash function
  ☆18Updated 14 years ago
• TokusiN / SuperSort
  Sort function at 5 to 7 times faster than std :: sort
  ☆15Updated 5 years ago
• loliGothicK / Cranberries
  ☆28Updated 2 years ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆45Updated 6 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆105Updated 7 years ago
• togatoga / screwsat
  A simple CDCL(Conflict-Driven-Clause-Learning) SAT solver in Rust.
  ☆38Updated 9 months ago
• amplab / succinct-cpp
  Succinct C++
  ☆24Updated 4 years ago
• retrieva / pficommon
  General purpose C++ library for PFI
  ☆159Updated 3 years ago