Alternatives and similar repositories for AquaHash:

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

• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆68Updated 7 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆104Updated 8 years ago
• martinus / better-faster-stronger-mixer
  Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.
  ☆38Updated 4 years ago
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆78Updated 3 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
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆29Updated 2 years ago
• skeeto / xf8
  8-bit Xor Filter in C99
  ☆61Updated 5 years ago
• google / hashtable-benchmarks
  ☆105Updated last year
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆52Updated 7 years ago
• backtrace-labs / umash
  UMASH: a fast enough hash and fingerprint with collision bounds
  ☆155Updated 2 months ago
• gerben-s / quicksort-blog-post
  ☆39Updated 4 years ago
• damageboy / vxsort-cpp
  My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)
  ☆30Updated last year
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆53Updated 5 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆48Updated 3 years ago
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆65Updated last year
• lemire / testingmlp
  Testing memory-level parallelism
  ☆68Updated last year
• pramalhe / CX
  A Wait-Free Universal Construct for Large Objects
  ☆96Updated 5 years ago
• WojciechMula / simd-byte-lookup
  SIMDized check which bytes are in a set
  ☆28Updated 6 years ago
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆83Updated last year
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 4 years ago
• mars-research / DRAMHiT
  ☆29Updated this week
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆116Updated 8 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 5 years ago
• dragontamer / AESRand
  Random Number Generator based on hardware-accelerated AES instructions
  ☆57Updated 5 years ago
• senderista / hashtable-benchmarks
  An Evaluation of Linear Probing Hashtable Algorithms
  ☆29Updated last year
• lemire / pospopcnt_avx512
  benchmarking positional population count
  ☆14Updated last year
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• fsaintjacques / jitmap
  LLVM-jitted bitmaps
  ☆27Updated 4 years ago
• maropu / integer_encoding_library
  An encoder/decoder collection for a sequence of integers
  ☆32Updated 12 years ago
• backtrace-labs / poireau
  Poireau: a sampling allocation debugger
  ☆87Updated 3 years ago