bertdobbelaere / SorterHunterLinks
An evolutionary approach to find small and low latency sorting networks
☆66Updated 2 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)☆121Updated 6 months ago
- Library for creation of SAT instances.☆23Updated 2 years ago
- A description of Minotaur can be found in https://arxiv.org/abs/2306.00229.☆109Updated 11 months ago
- ZP7: Zach's Peppy Parallel-Prefix-Popcountin' PEXT/PDEP Polyfill☆53Updated 11 months ago
- UMASH: a fast enough hash and fingerprint with collision bounds☆156Updated 5 months ago
- Random Number Generator based on hardware-accelerated AES instructions☆59Updated 6 years ago
- Testing common random-number generators (RNG)☆185Updated 2 years ago
- A basic implementation of the Small Primes Number-Theoretic Transform (NTT) multiplication algorithm.☆24Updated 7 years ago
- Bitset Sort, a faster std::sort replacement.☆78Updated 3 years ago
- A combined repository for all RLIBM prototypes☆45Updated 9 months ago
- Reference manual for ForwardCom instruction set and software standards☆168Updated 5 months ago
- A collection of array rotation algorithms.☆155Updated 2 years ago
- A benchmark for sorting algorithms☆60Updated 4 years ago
- The libsais library provides fast linear-time construction of suffix array (SA), generalized suffix array (GSA), longest common prefix (L…☆211Updated last month
- Storage for my snippets, toy programs, etc.☆361Updated 3 months ago
- O(n log n) In-place Stable Quicksort☆18Updated 7 months ago
- RLibm for 32-bit representations (float and posit32)☆61Updated 3 years ago
- AOCL-LibM☆116Updated last week
- Demo of a fast PNG encoder.☆97Updated 5 months ago
- Lower Size Bounds for Sorting Networks☆46Updated 4 years ago
- Integer Map Data Structure☆129Updated 2 years ago
- A minimalistic and high-performance SAT solver☆145Updated 3 years ago
- Assembly super-optimization via constraint solving☆206Updated last week
- This repository contains high-performance implementations of memset and memcpy in assembly.☆331Updated 3 years ago
- Fast random number generators: Vectorized (SIMD) version of xorshift128+☆117Updated 4 years ago
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- A C/C++ header file for fast 32-bit division remainders (and divisibility tests) on 64-bit hardware.☆320Updated 8 months ago
- A very fast and robust 64-bit PRNG with a minimum 2^64 period.☆148Updated last month
- A collection of various algorithms to produce length-limited prefix codes☆24Updated 4 years ago
- A minimal modern LZ compressor example☆59Updated 4 years ago