lemire / programmingishard

Related projects: ⓘ

• Const-me / MemoryAccessCosts
  ☆13Updated 6 years ago
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆17Updated 5 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆28Updated last year
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆47Updated 3 years ago
• mklarqvist / StormBitmaps
  Fast algorithms for computing XX^T for binary matrices
  ☆14Updated 4 years ago
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 8 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆24Updated 4 years ago
• fsaintjacques / jitmap
  LLVM-jitted bitmaps
  ☆26Updated 4 years ago
• dryman / hash_bench
  Popular hash table implementation benchmarks
  ☆27Updated 7 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆67Updated 7 years ago
• simdjson / simdjson_experiments_vldb2019
  Detailed experiments over simdjson for VLDB article (2019) and future work
  ☆22Updated 3 years ago
• lemire / backward_multiplication
  Multiplying... backward?
  ☆12Updated 4 years ago
• geofflangdale / smh
  Shuffle-based predicate matcher and all-round branch free swiss army chainsaw
  ☆16Updated 6 years ago
• det / segmented_tree
  Sequence data structure with efficient random access insert and erase
  ☆13Updated last year
• rlu-sync / rlu-rht
  RLU resizable hash-table
  ☆16Updated 9 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated last year
• senderista / hashtable-benchmarks
  An Evaluation of Linear Probing Hashtable Algorithms
  ☆29Updated 9 months ago
• s3cur3 / llvm-data-structure-benchmarks
  A benchmark for cache efficient data structures.
  ☆28Updated 5 years ago
• blu / ascii_pruner
  Pruning of blanks from an ASCII stream - musings in AMD64 and ARM64
  ☆8Updated 3 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(…
  ☆49Updated 5 months ago
• AnyDSL / runtime
  AnyDSL Runtime Library
  ☆20Updated last week
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆50Updated 7 years ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆52Updated 4 years ago
• efficient / fast-succinct-trie
  ☆24Updated 7 years ago
• lemire / talks
  Random material having to do with Daniel Lemire's talks
  ☆20Updated 4 months ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆79Updated 5 years ago
• wangyi-fudan / wyHLL
  The dream accurate approximate set cardinality estimator based on 3-bit HyperLogLog. More accurate than Redis HyperLogLog.
  ☆55Updated 3 years ago
• zwegner / Miroslav
  A proof-of-concept for a fast regex matcher using lossy NFA matching on SIMD
  ☆12Updated 5 years ago
• WojciechMula / simd-byte-lookup
  SIMDized check which bytes are in a set
  ☆27Updated 5 years ago
• mavam / compbench
  Benchmark and visualization of various compression algorithms
  ☆23Updated 8 years ago