Alternatives and similar repositories for FastShuffleExperiments

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

• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆84Updated 9 months ago
• skarupke / heap
  Looking into the performance of heaps, starting with the Min-Max Heap
  ☆69Updated 4 years ago
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆18Updated 7 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆92Updated last year
• ademakov / Oroch
  A C++ library for integer array compression
  ☆30Updated 3 years ago
• kfjahnke / zimt
  header-only C++ template library to process n-dimensional arrays with multithreaded SIMD code
  ☆49Updated 2 months ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆34Updated 2 years ago
• shaovoon / floatbench
  String to Float Benchmark
  ☆19Updated 7 years ago
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆51Updated 11 years ago
• lemire / SIMDxorshift
  Fast random number generators: Vectorized (SIMD) version of xorshift128+
  ☆120Updated 5 years ago
• philsquared / hash_trie
  A persistent hash array-mapped trie for C++
  ☆91Updated 2 years ago
• mikekazakov / eytzinger
  Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++
  ☆33Updated 8 years ago
• google / hashtable-benchmarks
  ☆112Updated last year
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆84Updated 6 years ago
• gerben-s / quicksort-blog-post
  ☆39Updated 4 years ago
• imneme / bounded-rands
  Methods and Benchmarks for Random Numbers in a Range
  ☆37Updated 7 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 2 years ago
• nadavrot / fast_log
  A fast implementation of log() and exp()
  ☆55Updated 3 years ago
• celtera / ahsohtoa
  Structure-of-array synthesis in C++20
  ☆80Updated 3 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆27Updated 6 years ago
• stgatilov / linear-vs-binary-search
  Comparing linear and binary searches
  ☆43Updated 5 years ago
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆78Updated 3 years ago
• RedBedHed / blipsort
  Branchless-Lomuto in Pattern-Defeating Quicksort
  ☆49Updated last year
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆49Updated 4 years ago
• greg7mdp / sho
  Small Hash Optimization - an optimization for when you have many small hash maps - similar to LLVM's small vector optimization.
  ☆39Updated 8 years ago
• yandex / fastops
  This small library enables acceleration of bulk calls of certain math functions on AVX and AVX2 hardware. Currently supported operations …
  ☆87Updated 4 years ago
• simdjson / simdjson_experiments_vldb2019
  Detailed experiments over simdjson for VLDB article (2019) and future work
  ☆21Updated 5 years ago
• skarupke / two_bit_mutex
  Mutexes that only use two bits. Either stored in a byte, or in the bottom bits of a pointer
  ☆26Updated 3 years ago
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆62Updated 4 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆36Updated 2 years ago