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
• backtrace-labs / umash
  UMASH: a fast enough hash and fingerprint with collision bounds
  ☆157Updated last month
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆27Updated 6 years ago
• dendibakh / perf-challenge6
  ☆29Updated 2 years ago
• lemire / fastrand
  Fast random number generation in an interval in Python: Up to 10x faster than random.randint.
  ☆117Updated last month
• andralex / MedianOfNinthers
  ☆50Updated 5 years ago
• dw / csvmonkey
  Header-only vectorized, lazy-decoding, zero-copy CSV file parser
  ☆99Updated last year
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆286Updated last month
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆61Updated 4 years ago
• lemire / FastShuffleExperiments
  How fast can we shuffle values?
  ☆38Updated last year
• vigna / sux
  Succinct data structures in C/C++
  ☆88Updated last year
• JacksonAllan / c_cpp_hash_tables_benchmark
  A comparative, extendable benchmarking suite for C and C++ hash-table libraries.
  ☆37Updated last year
• damageboy / vxsort-cpp
  My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)
  ☆30Updated last year
• google / hashtable-benchmarks
  ☆109Updated last year
• 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
  ☆53Updated last year
• geofflangdale / simdcsv
  A fast SIMD parser for CSV files
  ☆156Updated 3 years ago
• ademakov / Oroch
  A C++ library for integer array compression
  ☆29Updated 3 years ago
• senderista / hashtable-benchmarks
  An Evaluation of Linear Probing Hashtable Algorithms
  ☆32Updated last year
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆83Updated 6 years ago
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆78Updated 3 years ago
• martinus / better-faster-stronger-mixer
  Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.
  ☆40Updated 5 years ago
• gerben-s / quicksort-blog-post
  ☆39Updated 4 years ago
• mikekazakov / eytzinger
  Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++
  ☆33Updated 8 years ago
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆129Updated 3 years ago
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆48Updated 3 months ago
• tarsa / SortingAlgorithmsBenchmark
  ☆16Updated 11 years ago
• smart-tool / smart
  String Matching Algorithms Research Tool
  ☆107Updated last year
• nmmmnu / HM4
  Key/Value NoSQL database that utilize LSM trees
  ☆40Updated 2 weeks ago
• lemire / fastrange
  A fast alternative to the modulo reduction
  ☆313Updated 4 years ago
• lemire / testingRNG
  Testing common random-number generators (RNG)
  ☆189Updated 2 years ago