bertdobbelaere / SorterHunterLinks
An evolutionary approach to find small and low latency sorting networks
☆72Updated last week
Alternatives and similar repositories for SorterHunter
Users that are interested in SorterHunter are comparing it to the libraries listed below
Sorting:
- A description of Minotaur can be found in https://arxiv.org/abs/2306.00229.☆113Updated last month
- ZP7: Zach's Peppy Parallel-Prefix-Popcountin' PEXT/PDEP Polyfill☆58Updated last year
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆129Updated 10 months ago
- Assembly super-optimization via constraint solving☆223Updated last week
- UMASH: a fast enough hash and fingerprint with collision bounds☆158Updated last week
- Bitset Sort, a faster std::sort replacement.☆78Updated 3 years ago
- Storage for my snippets, toy programs, etc.☆368Updated last week
- Library for creation of SAT instances.☆23Updated 3 years ago
- Random Number Generator based on hardware-accelerated AES instructions☆61Updated 6 years ago
- A benchmark for sorting algorithms☆62Updated 4 years ago
- O(n log n) In-place Stable Quicksort☆20Updated 3 months ago
- RLibm for 32-bit representations (float and posit32)☆60Updated 4 years ago
- Reference manual for ForwardCom instruction set and software standards☆172Updated 9 months ago
- The libsais library provides fast linear-time construction of suffix array (SA), generalized suffix array (GSA), longest common prefix (L…☆226Updated 2 months ago
- Fast random number generators: Vectorized (SIMD) version of xorshift128+☆120Updated 5 years ago
- Testing common random-number generators (RNG)☆191Updated 2 years ago
- Lower Size Bounds for Sorting Networks☆46Updated 4 years ago
- Methods and Benchmarks for Random Numbers in a Range☆37Updated 7 years ago
- A combined repository for all RLIBM prototypes☆46Updated last year
- Experiments with array layouts for comparison-based searching☆84Updated last year
- Different algorithms for converting binary to decimal floating-point numbers☆125Updated 3 years ago
- A mirror of the CRLibm project from INRIA Forge☆49Updated 5 years ago
- ☆39Updated 4 years ago
- Radix sorting from the ground up☆37Updated last year
- Fast Hash Functions Using AES Intrinsics☆84Updated 6 years ago
- c++ library for binary fuse filters, including a sharded filter☆93Updated 9 months ago
- A minimalistic and high-performance SAT solver☆146Updated 4 years ago
- Poireau: a sampling allocation debugger☆98Updated 3 years ago
- String Matching Algorithms Research Tool☆107Updated last year
- InstLatX64_Demo☆45Updated 3 weeks ago