Alternatives and similar repositories for StronglyUniversalStringHashing

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

• fsaintjacques / libtwiddle
  bit & sketches data structures
  ☆60Updated 6 years ago
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆84Updated last year
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆119Updated 8 years ago
• cksystemsgroup / scalloc
  A Fast, Multicore-Scalable, Low-Fragmentation Memory Allocator
  ☆163Updated 2 months ago
• cruppstahl / libfor
  A very fast scalar implementation for Frame Of Reference integer compression.
  ☆109Updated 9 years ago
• scivey / xact
  multi-way atomic compare-and-swap with x64/TSX
  ☆86Updated 8 years ago
• vnmakarov / mum-hash
  Hashing functions and PRNGs based on them
  ☆162Updated 7 months ago
• preshing / CompareIntegerMaps
  Generates benchmark data for two different data structures, then renders some graphs.
  ☆112Updated 6 years ago
• ademakov / Evenk
  A C++ library for concurrent programming
  ☆71Updated 4 years ago
• regehr / nibble-sort
  Many functions in C for sorting the nibbles in an 8-byte word
  ☆33Updated 10 years ago
• wbhart / bsdnt
  BSD Licensed Bignum Library
  ☆232Updated last year
• dpt / Aha
  A tweaked version of Aha! ("A Hacker's Assistant") the superoptimiser by Henry S. Warren
  ☆58Updated 3 years ago
• appnexus / acf
  An-source C library developed and used at AppNexus.
  ☆111Updated 5 years ago
• simdhash / clhash
  C library implementing the ridiculously fast CLHash hashing function
  ☆281Updated last year
• coreperf / rejit
  fast SIMD-able JIT regular expression compiler
  ☆197Updated 10 years ago
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆124Updated last year
• rurban / Perfect-Hash
  generate perfect hashes (alpha)
  ☆77Updated 3 years ago
• lemire / fastrange
  A fast alternative to the modulo reduction
  ☆311Updated 4 years ago
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 11 years ago
• ned14 / nedtries
  A portable in-place bitwise binary Fredkin trie algorithm which allows for near constant time insertions, deletions, finds, closest fit f…
  ☆275Updated 4 years ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆108Updated 8 years ago
• jandrewrogers / MetroHash
  MetroHash v1: Exceptionally fast and statistically robust hash functions
  ☆369Updated 3 years ago
• johnmcfarlane / SG14
  A library for Study Group 14 of Working Group 21 (C++)
  ☆35Updated 7 years ago
• jfbastien / no-sane-compiler
  No sane compiler would optimize atomics: the presentation
  ☆107Updated 8 years ago
• marcandrysco / Errol
  Binary floating-point to decimal string conversion algorithm.
  ☆104Updated 7 years ago
• mettienne / tiered-vector
  Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…
  ☆50Updated last year
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 2 years ago
• lysevi / nkvdb
  nkvdb - is a numeric time-series database.
  ☆35Updated 8 years ago
• Bulat-Ziganshin / FARSH
  Fast and Reliable (but not Secure) Hash
  ☆54Updated 7 years ago
• ot / succinct
  A collection of succinct data structures
  ☆209Updated last year