sebawild / powersort

Related projects: ⓘ

• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated last year
• stgatilov / linear-vs-binary-search
  Comparing linear and binary searches
  ☆38Updated 4 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆28Updated last year
• google / zuckerli
  ☆27Updated last year
• WojciechMula / simd-byte-lookup
  SIMDized check which bytes are in a set
  ☆27Updated 5 years ago
• simdjson / simdjson_experiments_vldb2019
  Detailed experiments over simdjson for VLDB article (2019) and future work
  ☆22Updated 3 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆40Updated 2 weeks ago
• tarsa / SortingAlgorithmsBenchmark
  ☆15Updated 10 years ago
• andralex / MedianOfNinthers
  ☆49Updated 4 years ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆75Updated 5 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆47Updated 3 years ago
• jermp / s_indexes
  Universe-sliced indexes in C++.
  ☆17Updated last year
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆55Updated last year
• lemire / FastShuffleExperiments
  How fast can we shuffle values?
  ☆37Updated 6 months ago
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 3 years ago
• pasta-toolbox / bit_vector
  Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.
  ☆25Updated 2 weeks ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆67Updated 7 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆44Updated 4 years ago
• nadavrot / fast_log
  A fast implementation of log() and exp()
  ☆49Updated last year
• tkbtkysms / solca
  A Space-Optimal Grammar Compression
  ☆10Updated 3 years ago
• s3cur3 / llvm-data-structure-benchmarks
  A benchmark for cache efficient data structures.
  ☆28Updated 5 years ago
• WojciechMula / ternary-logic
  Support for ternary logic in SSE, XOP, AVX2 and x86 programs
  ☆30Updated 3 years ago
• google-research / automemcpy
  ☆21Updated 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
  ☆48Updated 7 months ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆45Updated 2 years ago
• khegeman / floki
  simd algorithms
  ☆9Updated 9 years ago
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆20Updated 2 weeks ago
• vreverdy / bit-algorithms
  An exploratory implementation of bit overloads of the C++ standard algorithms
  ☆18Updated 3 years ago
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆17Updated 5 years ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆50Updated 7 years ago