IlyaGrebnov / libcubwtLinks
libcubwt is a library for GPU accelerated suffix array and burrows wheeler transform construction.
☆37Updated last month
Alternatives and similar repositories for libcubwt
Users that are interested in libcubwt are comparing it to the libraries listed below
Sorting:
- A fast implementation of log() and exp()☆52Updated 2 years ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 5 years ago
- 8-bit Xor Filter in C99☆61Updated 5 years ago
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆30Updated last year
- A collection of SIMD optimized general purpose hash functions☆47Updated 10 years ago
- Vectorized version of the PCG random number generator☆83Updated 6 months ago
- Radix sorting from the ground up☆37Updated last year
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆30Updated 2 years ago
- Support for ternary logic in SSE, XOP, AVX2 and x86 programs☆31Updated 8 months ago
- ZP7: Zach's Peppy Parallel-Prefix-Popcountin' PEXT/PDEP Polyfill☆55Updated last year
- ✈️ PTHash is a fast and compact minimal perfect hash function.☆237Updated last week
- Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.☆40Updated 5 years ago
- The libsais library provides fast linear-time construction of suffix array (SA), generalized suffix array (GSA), longest common prefix (L…☆220Updated last week
- Fast random number generators: Vectorized (SIMD) version of xorshift128+☆119Updated 5 years ago
- ☆39Updated 4 years ago
- Benchmarks for our memory allocator☆69Updated last year
- A comparative, extendable benchmarking suite for C and C++ hash-table libraries.☆37Updated last year
- Fast C functions for the computing the positional popcount (pospopcnt).☆55Updated 5 years ago
- Flash Perfect Hash Table: an implementation of a dynamic perfect hash table, extremely fast for lookup☆46Updated 2 years ago
- ☆31Updated this week
- Looking into the performance of heaps, starting with the Min-Max Heap☆68Updated 4 years ago
- A benchmark for sorting algorithms☆61Updated 4 years ago
- Bitset Sort, a faster std::sort replacement.☆78Updated 3 years ago
- rans optimized tricks☆25Updated 7 years ago
- ☆62Updated 10 months ago
- UMASH: a fast enough hash and fingerprint with collision bounds☆158Updated 3 weeks ago
- header-only C++ template library to process n-dimensional arrays with multithreaded SIMD code☆46Updated 8 months ago
- TLSF: two-level segregated fit O(1) allocator☆80Updated 3 years ago
- Branchless-Lomuto in Pattern-Defeating Quicksort☆49Updated last year
- Different algorithms for converting binary to decimal floating-point numbers☆125Updated 2 years ago