Alternatives and similar repositories for fse-made-easy

Users that are interested in fse-made-easy are comparing it to the libraries listed below

• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 years ago
• geofflangdale / smh
  Shuffle-based predicate matcher and all-round branch free swiss army chainsaw
  ☆17Updated 7 years ago
• fanf2 / hg64
  a 64-bit histogram / quantile sketch
  ☆59Updated 7 months ago
• glinscott / linzip2
  A minimal modern LZ compressor example
  ☆59Updated 4 years ago
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆84Updated last year
• skeeto / prng64-shootout
  64-bit PRNG shootout
  ☆18Updated 2 months ago
• lemire / StronglyUniversalStringHashing
  Benchmark showing the we can randomly hash strings very quickly with good universality
  ☆137Updated 6 months ago
• stephenrkell / libcrunch
  A dynamically safe implementation of C, using your existing C compiler. Tolerates idiomatic C code pretty well. Not perfect... yet.
  ☆105Updated 10 months ago
• geofflangdale / sheng
  A small DFA for under 16 states
  ☆51Updated 7 years ago
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆78Updated 3 years ago
• jix / sortnetopt
  Lower Size Bounds for Sorting Networks
  ☆46Updated 4 years ago
• apankrat / notes
  Assorted notes
  ☆84Updated last year
• skeeto / xf8
  8-bit Xor Filter in C99
  ☆61Updated 5 years ago
• t1lang / t1bootstrap
  Bootstrap compiler
  ☆44Updated 6 years ago
• shawnanastasio / seq.asm
  Minimal implementation of UNIX seq command in x86_64 assembly.
  ☆40Updated 8 years ago
• emilk / drop-merge-sort
  A novel adaptive sorting algorithm
  ☆173Updated 3 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆30Updated 2 years ago
• catern / sfork
  A synchronous, single-threaded interface for starting processes on Linux
  ☆34Updated 3 years ago
• FastFilter / FilterPassword
  Experiments in C++: binary fuse filters vs. Bloom filters
  ☆49Updated 7 months ago
• utsaslab / nofs
  The No-Order File System (NoFS)
  ☆47Updated 12 years ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆82Updated 5 years ago
• WojciechMula / base64-avx512
  Code for paper "Base64 encoding and decoding at almost the speed of a memory copy"
  ☆204Updated 5 years ago
• stephenrkell / donald
  The Mickey Mouse of dynamic linkers
  ☆14Updated 3 weeks ago
• andrewrk / malcheck
  Test your code with malcheck to make sure it handles out of memory conditions correctly.
  ☆97Updated 9 years ago
• backtrace-labs / umash
  UMASH: a fast enough hash and fingerprint with collision bounds
  ☆157Updated 6 months ago
• MartinezTorres / marlin
  Marlin: high throughput entropy compressor
  ☆30Updated 2 years ago
• wangyi-fudan / wyHLL
  The dream accurate approximate set cardinality estimator based on 3-bit HyperLogLog. More accurate than Redis HyperLogLog.
  ☆55Updated 4 years ago
• rurban / perl-hash-stats
  Counting the collisions with perl hash tables per function
  ☆12Updated 6 years ago
• pramalhe / CX
  A Wait-Free Universal Construct for Large Objects
  ☆96Updated 5 years ago
• dpt / Aha
  A tweaked version of Aha! ("A Hacker's Assistant") the superoptimiser by Henry S. Warren
  ☆58Updated 3 years ago