bingmann / parallel-string-sorting
Collection of Parallel String Sorting Algorithms including Parallel Super Scalar String Sample Sort and Parallel Multiway LCP-Mergesort
☆32Updated last year
Alternatives and similar repositories for parallel-string-sorting:
Users that are interested in parallel-string-sorting are comparing it to the libraries listed below
- Vectorized version of the PCG random number generator☆75Updated 6 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- Pruning elements in SIMD vectors (i.e., packing left elements)☆63Updated 11 months ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 7 years ago
- An implementation of optimized parallel radix sort☆47Updated 6 years ago
- A collection of string sorting algorithms☆55Updated 2 years ago
- Compact Tree Representation☆16Updated 7 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 3 years ago
- AVX512F and AVX2 versions of quick sort☆105Updated 7 years ago
- A benchmark for sorting algorithms☆59Updated 3 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 2 years ago
- A hash table implementation using Robin Hood Linear Probing☆50Updated 10 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆62Updated 7 months ago
- Comparing linear and binary searches☆39Updated 4 years ago
- Vectorized intersections (research code)☆14Updated 8 years ago
- Compact Data Structures Library☆98Updated 2 years ago
- C library to compute the Hamming weight of arrays☆45Updated 6 years ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆49Updated 9 months ago
- Information about AVX-512 support on recent Intel processors☆43Updated 2 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 4 months ago
- 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 …☆22Updated 2 years ago
- ☆49Updated 4 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆116Updated 7 years ago
- C++ reimplementation of https://github.com/emilk/drop-merge-sort☆21Updated 3 years ago
- A word-aligned integer compression algorithm.☆12Updated 6 months ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- Radix sort implemented i Java and C/C++ with benchmark.☆41Updated 13 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆55Updated last year
- FOundation of stXXl and thriLL☆14Updated 11 months ago