Alternatives and similar repositories for libcubwt:

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

• nadavrot / fast_log
  A fast implementation of log() and exp()
  ☆53Updated 2 years ago
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆65Updated last year
• damageboy / vxsort-cpp
  My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)
  ☆30Updated last year
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆29Updated 2 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• jermp / psds
  Efficient Prefix-Sum data structures in C++.
  ☆25Updated last year
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 5 years ago
• skeeto / xf8
  8-bit Xor Filter in C99
  ☆61Updated 5 years ago
• WojciechMula / ternarylogiccli
  CLI utilty to work out proper constants for vpternlogic instruction
  ☆13Updated 2 years ago
• eloj / radix-sorting
  Radix sorting from the ground up
  ☆36Updated last year
• kfjahnke / zimt
  header-only C++ template library to process n-dimensional arrays with multithreaded SIMD code
  ☆42Updated 3 months ago
• mars-research / DRAMHiT
  ☆29Updated this week
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 7 months ago
• komrad36 / FastArrayOps
  Extremely fast x86 / AVX2 assembly implementations of common operations for linear arrays: checking whether array contains element, findi…
  ☆37Updated 3 years ago
• WojciechMula / simd-byte-lookup
  SIMDized check which bytes are in a set
  ☆28Updated 6 years ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆53Updated 5 years ago
• unum-cloud / ucset
  If only std::set was a DBMS: collection of templated ACID in-memory exception-free thread-safe and concurrent containers in a header-only…
  ☆39Updated last year
• loxxous / Behemoth-Rank-Coding
  Fast and Strong Burrows Wheeler Model
  ☆19Updated 6 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.
  ☆29Updated 2 weeks ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆68Updated 7 years ago
• WojciechMula / ternary-logic
  Support for ternary logic in SSE, XOP, AVX2 and x86 programs
  ☆31Updated 3 months ago
• martinus / better-faster-stronger-mixer
  Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.
  ☆38Updated 4 years ago
• lemire / pospopcnt_avx512
  benchmarking positional population count
  ☆14Updated last year
• google / zuckerli
  ☆27Updated 2 years ago
• easyaspi314 / xxhash-clean
  xxHash Cleaner C Reference Implementation
  ☆44Updated 4 years ago
• nicola-gigante / bitvector
  A C++ container-like data structure for storing a vector of bits with fast appending on both sides and fast insertion in the middle, all …
  ☆26Updated 2 years ago
• renzibei / fph-table
  Flash Perfect Hash Table: an implementation of a dynamic perfect hash table, extremely fast for lookup
  ☆42Updated last year
• IlyaGrebnov / libsais
  libsais is a library for linear time suffix array, longest common prefix array and burrows wheeler transform construction based on induce…
  ☆204Updated last week
• vteromero / VTEnc
  VTEnc C library
  ☆37Updated 2 years ago
• lemire / FastShuffleExperiments
  How fast can we shuffle values?
  ☆37Updated last year