iwiwi / parallel-radix-sortLinks
An implementation of optimized parallel radix sort
☆49Updated 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
Sorting:
- A parallelized implementation of optimized MSD radix sort for strings☆27Updated 6 years ago
- An implementation of radix heap☆62Updated 10 years ago
- Light weight thread library☆66Updated 7 months ago
- instruction-bench☆36Updated 2 years ago
- C++17 implementation of memory-efficient dynamic tries☆58Updated 3 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 7 years ago
- a tiny library for C++☆65Updated 2 months ago
- Experimental implementations of lock-free algorithms, using hazard pointers and tagged pointers.☆31Updated 13 years ago
- implementation of dynamic wavelet matrix(tree) and static wavelet matrix☆22Updated 6 years ago
- ☆52Updated 4 years ago
- Radix sort implemented i Java and C/C++ with benchmark.☆41Updated 14 years ago
- ☆13Updated 5 years ago
- Fast compressed trie dictionary library☆69Updated 9 months ago
- Collection of Parallel String Sorting Algorithms including Parallel Super Scalar String Sample Sort and Parallel Multiway LCP-Mergesort☆33Updated 2 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- C++11TMP compile time C compiler☆27Updated 7 years ago
- In-place Parallel Super Scalar Radix Sort (IPS²Ra)☆32Updated 5 months ago
- Fast in-place radix sort with STL-like API☆47Updated 8 years ago
- A simple CDCL(Conflict-Driven-Clause-Learning) SAT solver in Rust.☆38Updated 11 months ago
- Compact Data Structures Library☆100Updated 3 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 …☆26Updated 3 years ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆11Updated 2 years ago
- Lock-free parallel disjoint set data structure (aka UNION-FIND) with path compression and union by rank☆65Updated 9 years ago
- qcc is a small toy C compiler☆41Updated 8 years ago
- fast log and exp functions for AVX2/AVX-512☆231Updated 3 months ago
- Compact Data Structures Library☆126Updated 10 years ago
- ASM generation tool for GAS/NASM/MASM with Xbyak-like syntax in Python☆12Updated 3 months ago
- Fast User Level LOCK library☆27Updated 3 months ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 9 months ago