bertdobbelaere / SorterHunterLinks
An evolutionary approach to find small and low latency sorting networks
☆66Updated 3 months ago
Alternatives and similar repositories for SorterHunter
Users that are interested in SorterHunter are comparing it to the libraries listed below
Sorting:
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆122Updated 6 months ago
- ZP7: Zach's Peppy Parallel-Prefix-Popcountin' PEXT/PDEP Polyfill☆54Updated 11 months ago
- A description of Minotaur can be found in https://arxiv.org/abs/2306.00229.☆110Updated last year
- Library for creation of SAT instances.☆23Updated 2 years ago
- Testing common random-number generators (RNG)☆186Updated 2 years ago
- A combined repository for all RLIBM prototypes☆46Updated 10 months ago
- Bitset Sort, a faster std::sort replacement.☆78Updated 3 years ago
- RLibm for 32-bit representations (float and posit32)☆61Updated 3 years ago
- UMASH: a fast enough hash and fingerprint with collision bounds☆157Updated 6 months ago
- A minimalistic and high-performance SAT solver☆146Updated 3 years ago
- Random Number Generator based on hardware-accelerated AES instructions☆59Updated 6 years ago
- Reference manual for ForwardCom instruction set and software standards☆168Updated 6 months ago
- A benchmark for sorting algorithms☆61Updated 4 years ago
- Storage for my snippets, toy programs, etc.☆362Updated 4 months ago
- Fast random number generators: Vectorized (SIMD) version of xorshift128+☆117Updated 5 years ago
- Lower Size Bounds for Sorting Networks☆46Updated 4 years ago
- The libsais library provides fast linear-time construction of suffix array (SA), generalized suffix array (GSA), longest common prefix (L…☆215Updated last month
- Experiments with array layouts for comparison-based searching☆84Updated last year
- O(n log n) In-place Stable Quicksort☆19Updated 7 months ago
- Fastest CPU SIMD (SSE4) sorting networks for small integer arrays (2-6 elements), also optimal amd64 assembly and notes on getting compil…☆48Updated 4 years ago
- ☆39Updated 4 years ago
- Assembly super-optimization via constraint solving☆213Updated this week
- Methods and Benchmarks for Random Numbers in a Range☆37Updated 7 years ago
- Comparing linear and binary searches☆41Updated 5 years ago
- A fast alternative to the modulo reduction☆311Updated 4 years ago
- AOCL-LibM☆116Updated 3 weeks ago
- Shuffle-based predicate matcher and all-round branch free swiss army chainsaw☆17Updated 7 years ago
- A Valgrind tool for Herbie☆94Updated 2 years ago
- Binary floating-point to decimal string conversion algorithm.☆104Updated 7 years ago
- A mirror of the CRLibm project from INRIA Forge☆48Updated 4 years ago