Alternatives and similar repositories for talks

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

• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆27Updated 5 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• sillycross / mlpds
  MlpIndex - Extremely fast ordered index via memory level parallelism
  ☆12Updated 6 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆49Updated 4 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆30Updated 2 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆89Updated 9 months ago
• tarsa / SortingAlgorithmsBenchmark
  ☆16Updated 11 years ago
• lemire / backward_multiplication
  Multiplying... backward?
  ☆14Updated 4 years ago
• WojciechMula / ternary-logic
  Support for ternary logic in SSE, XOP, AVX2 and x86 programs
  ☆31Updated 6 months ago
• WojciechMula / simd-byte-lookup
  SIMDized check which bytes are in a set
  ☆28Updated 6 years ago
• KWillets / range_generator
  Some variations on Lemire's Fast Random Integer Generation in an Interval
  ☆15Updated 5 years ago
• google / zuckerli
  ☆28Updated 2 years ago
• martinus / better-faster-stronger-mixer
  Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.
  ☆40Updated 4 years ago
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 3 years ago
• powturbo / Turbo-Transpose
  Transpose: SIMD Integer+Floating Point Compression Filter
  ☆61Updated 5 years ago
• s3cur3 / llvm-data-structure-benchmarks
  A benchmark for cache efficient data structures.
  ☆30Updated 6 years ago
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆60Updated 4 years ago
• lemire / FastShuffleExperiments
  How fast can we shuffle values?
  ☆37Updated last year
• travisdowns / concurrency-hierarchy-bench
  Supporting code for the concurrency hierarchy described in this blog post: https://travisdowns.github.io/blog/2020/07/06/concurrency-cost…
  ☆26Updated 3 years ago
• plasma-umass / memory-landscape
  The space of memory management research and systems produced by the PLASMA lab (https://plasma-umass.org).
  ☆20Updated 4 years ago
• mklarqvist / StormBitmaps
  Fast algorithms for computing XX^T for binary matrices
  ☆14Updated 5 years ago
• ademakov / Oroch
  A C++ library for integer array compression
  ☆29Updated 3 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 4 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 5 years ago
• Bulat-Ziganshin / FARSH
  Fast and Reliable (but not Secure) Hash
  ☆54Updated 7 years ago
• WojciechMula / simd-heap
  ☆10Updated 5 months ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆52Updated 8 years ago
• fast-pack / FrameOfReference
  C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference
  ☆54Updated last year
• KWillets / simd_interleave
  Interleaving bits from two sources using SIMD instructions.
  ☆14Updated 7 years ago
• jbapple / libfilter
  High-speed Bloom filters and taffy filters for C, C++, and Java
  ☆35Updated last year