Alternatives and similar repositories for kxsort

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

• dominikkempa / zip-tree
  C++ Implementation of Zip Trees
  ☆14Updated 2 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆32Updated last year
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 8 months 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
• 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 3 years ago
• roberto-trani / mphf_benchmark
  A Benchmark of Minimal Perfect Hash Function Algorithms.
  ☆35Updated 2 years ago
• ips4o / ips2ra
  In-place Parallel Super Scalar Radix Sort (IPS²Ra)
  ☆31Updated 4 months ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆63Updated 11 months ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆53Updated 5 years ago
• refresh-bio / RADULS
  Ultra fast MSD radix sorter
  ☆11Updated 4 years ago
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆65Updated last year
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 4 years ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 8 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 5 years ago
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 2 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆105Updated 7 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆53Updated last year
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆77Updated 2 months ago
• kampersanda / poplar-trie
  C++17 implementation of memory-efficient dynamic tries
  ☆58Updated 3 years ago
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆27Updated last month
• wjakob / dset
  Lock-free parallel disjoint set data structure (aka UNION-FIND) with path compression and union by rank
  ☆64Updated 9 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
  ☆53Updated last year
• eloj / radix-sorting
  Radix sorting from the ground up
  ☆36Updated last year
• lorenzhs / ssssort
  Super Scalar Sample Sort in modern C++
  ☆20Updated 4 years ago
• jermp / psds
  Efficient Prefix-Sum data structures in C++.
  ☆25Updated last year
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 3 years ago
• itomomoti / OnlineRlbwt
  Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.
  ☆15Updated 7 years ago
• rantala / string-sorting
  A collection of string sorting algorithms
  ☆55Updated 3 years ago
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆11Updated 2 years ago