andralex / MedianOfNinthers

Related projects ⓘ

Alternatives and complementary repositories for MedianOfNinthers

• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated last year
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆44Updated 5 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆48Updated 3 years ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆75Updated 5 years ago
• lemire / FastShuffleExperiments
  How fast can we shuffle values?
  ☆37Updated 8 months ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆51Updated 7 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 7 years ago
• mettienne / tiered-vector
  Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…
  ☆49Updated 7 months ago
• vigna / sux
  Succinct data structures in C/C++
  ☆82Updated last month
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆50Updated 6 years ago
• ademakov / Oroch
  A C++ library for integer array compression
  ☆27Updated 2 years ago
• lemire / FrameOfReference
  C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference
  ☆50Updated 9 months ago
• schani / linbin
  Linear vs binary search benchmark
  ☆41Updated 4 years ago
• STEllAR-GROUP / hpxcl
  This repository contains components that will support percolation via OpenCL and CUDA
  ☆32Updated 2 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆53Updated 10 months ago
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆60Updated 9 months ago
• fjtapia / sort_parallel
  ☆13Updated 2 years ago
• powturbo / Turbo-Transpose
  Transpose: SIMD Integer+Floating Point Compression Filter
  ☆59Updated 5 years ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆53Updated 4 years ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 2 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆55Updated last year
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 13 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆25Updated 5 years ago
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆50Updated 10 years ago
• kampersanda / poplar-trie
  C++17 implementation of memory-efficient dynamic tries
  ☆57Updated 2 years ago
• maropu / integer_encoding_library
  An encoder/decoder collection for a sequence of integers
  ☆32Updated 11 years ago
• stxxl / foxxll
  FOundation of stXXl and thriLL
  ☆14Updated 10 months ago
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆80Updated 10 months ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆62Updated 5 months ago