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 / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆29Updated 2 years ago
• WojciechMula / simd-heap
  ☆10Updated 5 months ago
• mklarqvist / StormBitmaps
  Fast algorithms for computing XX^T for binary matrices
  ☆14Updated 5 years ago
• tarsa / SortingAlgorithmsBenchmark
  ☆16Updated 11 years ago
• sillycross / mlpds
  MlpIndex - Extremely fast ordered index via memory level parallelism
  ☆12Updated 6 years ago
• max0x7ba / parse-integers-benchmark
  Benchmarking reading and parsing integers from a file in C++.
  ☆9Updated 5 years ago
• ademakov / Oroch
  A C++ library for integer array compression
  ☆29Updated 3 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• lemire / backward_multiplication
  Multiplying... backward?
  ☆14Updated 4 years ago
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 3 years ago
• 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
• jermp / psds
  Efficient Prefix-Sum data structures in C++.
  ☆26Updated last year
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 5 years ago
• maropu / integer_encoding_library
  An encoder/decoder collection for a sequence of integers
  ☆32Updated 12 years ago
• lemire / FastShuffleExperiments
  How fast can we shuffle values?
  ☆37Updated last year
• greg7mdp / amt
  An Array Mapped Tree implementation
  ☆10Updated 4 years ago
• google-research / automemcpy
  ☆20Updated 3 years ago
• WojciechMula / simd-byte-lookup
  SIMDized check which bytes are in a set
  ☆28Updated 6 years ago
• KWillets / simd_interleave
  Interleaving bits from two sources using SIMD instructions.
  ☆14Updated 7 years ago
• STEllAR-GROUP / hpxcl
  This repository contains components that will support percolation via OpenCL and CUDA
  ☆32Updated 3 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
• WojciechMula / ternarylogiccli
  CLI utilty to work out proper constants for vpternlogic instruction
  ☆13Updated 2 years ago
• damageboy / vxsort-cpp
  My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)
  ☆30Updated last year
• ashvardanian / HashTableBenchmark
  A simple cross-platform speed & memory-efficiency benchmark for the most common hash-table implementations in the C++ world
  ☆11Updated 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
• boostorg / scope
  Boost.Scope, a collection of scope guard utilities.
  ☆16Updated last week
• renzibei / hashtable-bench
  A benchmark for hash tables and hash functions in C++, evaluate on different data as comprehensively as possible
  ☆20Updated 3 months ago