iwiwi / parallel-radix-sort
An implementation of optimized parallel radix sort
☆47Updated 6 years ago
Alternatives and similar repositories for parallel-radix-sort:
Users that are interested in parallel-radix-sort are comparing it to the libraries listed below
- A parallelized implementation of optimized MSD radix sort for strings☆27Updated 6 years ago
- Compact Data Structures Library☆98Updated 2 years ago
- Experimental implementations of lock-free algorithms, using hazard pointers and tagged pointers.☆31Updated 13 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- AVX512F and AVX2 versions of quick sort☆105Updated 7 years ago
- Collection of Parallel String Sorting Algorithms including Parallel Super Scalar String Sample Sort and Parallel Multiway LCP-Mergesort☆32Updated last year
- C++11TMP compile time C compiler☆27Updated 7 years ago
- An implementation of radix heap☆62Updated 9 years ago
- Fast in-place radix sort with STL-like API☆46Updated 8 years 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
- C++17 implementation of memory-efficient dynamic tries☆57Updated 2 years ago
- Fast differential coding functions (using SIMD instructions)☆51Updated 7 years ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆11Updated 2 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆116Updated 7 years ago
- Quick sort code using AVX2 instructions☆68Updated 7 years ago
- An implementation of minimal perfect hash function☆18Updated 14 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 2 years ago
- Vectorized version of the PCG random number generator☆75Updated 6 years ago
- ☆12Updated 4 years ago
- Radix sorting from the ground up☆36Updated last year
- Dynamic succinct/compressed data structures☆112Updated 8 months ago
- Compact Tree Representation☆16Updated 7 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
- Automatically exported from code.google.com/p/tx-trie☆28Updated 9 years ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆63Updated 11 months ago
- Light weight thread library☆65Updated 2 months ago
- instruction-bench☆35Updated 2 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 7 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆27Updated 2 months ago