Alternatives and similar repositories for talks

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

• 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++
  ☆88Updated 11 months ago
• lemire / fastrand
  Fast random number generation in an interval in Python: Up to 10x faster than random.randint.
  ☆116Updated 2 weeks ago
• backtrace-labs / umash
  UMASH: a fast enough hash and fingerprint with collision bounds
  ☆158Updated 3 weeks ago
• dw / csvmonkey
  Header-only vectorized, lazy-decoding, zero-copy CSV file parser
  ☆99Updated last year
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆48Updated 3 months ago
• JacksonAllan / c_cpp_hash_tables_benchmark
  A comparative, extendable benchmarking suite for C and C++ hash-table libraries.
  ☆37Updated last year
• geofflangdale / simdcsv
  A fast SIMD parser for CSV files
  ☆156Updated 3 years ago
• smart-tool / smart
  String Matching Algorithms Research Tool
  ☆104Updated last year
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆27Updated 5 years ago
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆282Updated 3 weeks ago
• damageboy / vxsort-cpp
  My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)
  ☆30Updated last year
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆61Updated 4 years ago
• pdillinger / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆22Updated 4 years ago
• dendibakh / perf-challenge6
  ☆29Updated 2 years ago
• google / hashtable-benchmarks
  ☆109Updated last year
• yandex / fastops
  This small library enables acceleration of bulk calls of certain math functions on AVX and AVX2 hardware. Currently supported operations …
  ☆87Updated 3 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆83Updated 6 years ago
• andralex / MedianOfNinthers
  ☆50Updated 5 years ago
• senderista / hashtable-benchmarks
  An Evaluation of Linear Probing Hashtable Algorithms
  ☆32Updated last year
• tommyettinger / waterhash
  Variant on Wang Yi's wyhash with 32-bit output, using at most 64-bit math
  ☆26Updated 6 years ago
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆27Updated 5 months ago
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆129Updated 3 years ago
• lemire / FastShuffleExperiments
  How fast can we shuffle values?
  ☆38Updated last year
• lemire / cbitset
  A simple bitset library in C
  ☆137Updated 6 months ago
• skarupke / two_bit_mutex
  Mutexes that only use two bits. Either stored in a byte, or in the bottom bits of a pointer
  ☆25Updated 2 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
• powturbo / Turbo-Transpose
  Transpose: SIMD Integer+Floating Point Compression Filter
  ☆62Updated 5 years ago
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆78Updated 3 years ago