Alternatives and similar repositories for FastShuffleExperiments

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

• mikekazakov / eytzinger
  Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++
  ☆33Updated 8 years ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆84Updated 8 months ago
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆18Updated 7 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆91Updated last year
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆84Updated 6 years ago
• lemire / SIMDxorshift
  Fast random number generators: Vectorized (SIMD) version of xorshift128+
  ☆120Updated 5 years ago
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆65Updated last year
• ademakov / Oroch
  A C++ library for integer array compression
  ☆29Updated 3 years ago
• RedBedHed / blipsort
  Branchless-Lomuto in Pattern-Defeating Quicksort
  ☆49Updated last year
• Morwenn / poplar-heap
  make_heap and sort_heap for a poplar heap with O(1) extra memory
  ☆41Updated last year
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• backtrace-labs / umash
  UMASH: a fast enough hash and fingerprint with collision bounds
  ☆159Updated last month
• damageboy / vxsort-cpp
  My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)
  ☆30Updated 2 years ago
• google / hashtable-benchmarks
  ☆111Updated last year
• attractivechaos / udb2
  For details, see the blog post:
  ☆34Updated last year
• philsquared / hash_trie
  A persistent hash array-mapped trie for C++
  ☆91Updated 2 years ago
• gerben-s / quicksort-blog-post
  ☆39Updated 4 years ago
• jwtowner / lug
  C++ embedded domain specific language for extended parsing expression grammars (PEGs)
  ☆83Updated 7 months ago
• andralex / MedianOfNinthers
  ☆50Updated 5 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆27Updated 6 years ago
• smart-tool / smart
  String Matching Algorithms Research Tool
  ☆108Updated last year
• kfjahnke / zimt
  header-only C++ template library to process n-dimensional arrays with multithreaded SIMD code
  ☆47Updated last month
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆51Updated 11 years ago
• skarupke / heap
  Looking into the performance of heaps, starting with the Min-Max Heap
  ☆69Updated 4 years ago
• stgatilov / linear-vs-binary-search
  Comparing linear and binary searches
  ☆42Updated 5 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆31Updated 2 years ago
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆78Updated 3 years ago
• JacksonAllan / c_cpp_hash_tables_benchmark
  A comparative, extendable benchmarking suite for C and C++ hash-table libraries.
  ☆39Updated last year
• martinus / better-faster-stronger-mixer
  Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.
  ☆40Updated 5 years ago
• dragontamer / AESRand
  Random Number Generator based on hardware-accelerated AES instructions
  ☆61Updated 6 years ago