minjaehwang / bitsetsort

Related projects: ⓘ

• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆79Updated 5 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆67Updated 7 years ago
• skeeto / xf8
  8-bit Xor Filter in C99
  ☆61Updated 4 years ago
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆57Updated 3 years ago
• backtrace-labs / umash
  UMASH: a fast enough hash and fingerprint with collision bounds
  ☆152Updated 2 years ago
• gerben-s / quicksort-blog-post
  ☆39Updated 3 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆114Updated 7 years ago
• lemire / despacer
  C library to remove white space from strings as fast as possible
  ☆149Updated 2 weeks ago
• dragontamer / AESRand
  Random Number Generator based on hardware-accelerated AES instructions
  ☆56Updated 5 years ago
• KholdStare / qnd-integer-parsing-experiments
  Quick 'n' Dirty benchmarks for various integer parsing methods in C++
  ☆40Updated 4 years ago
• stg7 / haesni
  haesni is a small hash function using aes-ni for fast string hashing
  ☆16Updated 5 years ago
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆80Updated 8 months ago
• google / hashtable-benchmarks
  ☆104Updated 7 months ago
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 3 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated last year
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆50Updated 10 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆47Updated 3 years ago
• lemire / validateutf8-experiments
  Reproducible experimeents on UTF-8 validation using SIMD instructions
  ☆40Updated 3 weeks ago
• lemire / testingmlp
  Testing memory-level parallelism
  ☆64Updated 6 months ago
• skarupke / heap
  Looking into the performance of heaps, starting with the Min-Max Heap
  ☆62Updated 3 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆28Updated last year
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆52Updated 4 years ago
• zwegner / zp7
  ZP7: Zach's Peppy Parallel-Prefix-Popcountin' PEXT/PDEP Polyfill
  ☆43Updated last month
• pramalhe / CX
  A Wait-Free Universal Construct for Large Objects
  ☆95Updated 4 years ago
• eloj / radix-sorting
  Radix sorting from the ground up
  ☆34Updated 8 months ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆31Updated 9 months ago
• geofflangdale / sheng
  A small DFA for under 16 states
  ☆52Updated 6 years ago
• lemire / SIMDxorshift
  Fast random number generators: Vectorized (SIMD) version of xorshift128+
  ☆109Updated 4 years ago
• ips4o / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆114Updated 4 months ago
• WojciechMula / simd-byte-lookup
  SIMDized check which bytes are in a set
  ☆27Updated 5 years ago