Alternatives and similar repositories for MedianOfNinthers

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

• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆46Updated 6 years ago
• lemire / FastShuffleExperiments
  How fast can we shuffle values?
  ☆37Updated last year
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆49Updated 4 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 years ago
• lemire / Concise
  C++ implementation of Concise and WAH compressed bitsets
  ☆20Updated 8 years ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆79Updated 3 months ago
• philsquared / hash_trie
  A persistent hash array-mapped trie for C++
  ☆91Updated 2 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆27Updated 5 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• ademakov / Oroch
  A C++ library for integer array compression
  ☆29Updated 3 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆54Updated 7 years ago
• fjtapia / sort_parallel
  ☆13Updated last month
• schani / linbin
  Linear vs binary search benchmark
  ☆40Updated 5 years ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 3 years ago
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆51Updated 11 years ago
• google / hashtable-benchmarks
  ☆107Updated last year
• komrad36 / SortingNetworks
  Fastest CPU SIMD (SSE4) sorting networks for small integer arrays (2-6 elements), also optimal amd64 assembly and notes on getting compil…
  ☆45Updated 4 years ago
• gpichot / cpp-tdigest
  [Not maintained] Implementation of TDigest algorithm in C++
  ☆16Updated 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
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆56Updated 2 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆29Updated 2 years ago
• yandex / fastops
  This small library enables acceleration of bulk calls of certain math functions on AVX and AVX2 hardware. Currently supported operations …
  ☆88Updated 3 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆89Updated 8 months ago
• google / hashing-demo
  Sample implementation of a proposed C++ hashing framework
  ☆29Updated 9 years ago
• skarupke / heap
  Looking into the performance of heaps, starting with the Min-Max Heap
  ☆66Updated 4 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆32Updated last year
• goldsborough / bloom-cpp
  A header-only bloom filter implementation in C++14.
  ☆13Updated 6 years ago
• alasdairmackintosh / google-concurrency-library
  Automatically exported from code.google.com/p/google-concurrency-library
  ☆35Updated 9 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆63Updated last year