Alternatives and similar repositories for talks

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

• backtrace-labs / umash
  UMASH: a fast enough hash and fingerprint with collision bounds
  ☆159Updated 3 weeks ago
• lemire / fastrand
  Fast random number generation in an interval in Python: Up to 10x faster than random.randint.
  ☆122Updated last week
• vigna / sux
  Succinct data structures in C/C++
  ☆93Updated last year
• smart-tool / smart
  String Matching Algorithms Research Tool
  ☆108Updated last year
• dw / csvmonkey
  Header-only vectorized, lazy-decoding, zero-copy CSV file parser
  ☆99Updated last year
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆51Updated 7 months ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆31Updated 3 years ago
• damageboy / vxsort-cpp
  My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)
  ☆31Updated last week
• yandex / fastops
  This small library enables acceleration of bulk calls of certain math functions on AVX and AVX2 hardware. Currently supported operations …
  ☆86Updated 4 years ago
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆289Updated 5 months ago
• quantopian / libpy
  Utilities for writing C++ extension modules.
  ☆84Updated 2 years ago
• senderista / hashtable-benchmarks
  An Evaluation of Linear Probing Hashtable Algorithms
  ☆39Updated 2 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆27Updated 6 years ago
• lemire / fastmod
  A C/C++ header file for fast 32-bit division remainders (and divisibility tests) on 64-bit hardware.
  ☆341Updated last year
• andralex / MedianOfNinthers
  ☆50Updated 5 years ago
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆79Updated 4 years ago
• pdillinger / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆24Updated 4 years ago
• JacksonAllan / c_cpp_hash_tables_benchmark
  A comparative, extendable benchmarking suite for C and C++ hash-table libraries.
  ☆43Updated last year
• ips4o / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆132Updated last year
• pramalhe / CX
  A Wait-Free Universal Construct for Large Objects
  ☆96Updated 6 years ago
• pramalhe / OneFile
  The world's first wait-free Software Transactional Memory
  ☆175Updated 5 years ago
• lemire / FastShuffleExperiments
  How fast can we shuffle values?
  ☆40Updated last year
• paulross / skiplist
  A C++ skip list with Python bindings. This can be used to calculate a rolling median - fast!
  ☆50Updated last week
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆129Updated 4 years ago
• dendibakh / perf-challenge6
  ☆29Updated 2 years ago
• lemire / cbitset
  A simple bitset library in C
  ☆144Updated 3 weeks ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆36Updated 3 years ago
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆63Updated 4 years ago
• viega / hatrack
  Fast, multi-reader, multi-writer, lockless data structures for parallel programming
  ☆87Updated 2 years ago
• geofflangdale / simdcsv
  A fast SIMD parser for CSV files
  ☆159Updated 3 years ago