umontreal-simul / TestU01-2009Links
This is the 2009 version of TestU01, a software library, implemented in the ANSI C language, and offering a collection of utilities for the empirical statistical testing of uniform random number generators.
☆75Updated last year
Alternatives and similar repositories for TestU01-2009
Users that are interested in TestU01-2009 are comparing it to the libraries listed below
Sorting:
- Assembly super-optimization via constraint solving☆223Updated last week
- Testing common random-number generators (RNG)☆191Updated 2 years ago
- Code generation tool to generate mathematical libraries☆57Updated 3 weeks ago
- Givaro - C++ library for arithmetic and algebraic computations☆52Updated last month
- 🚀 Sum of the primes below x☆38Updated 3 years ago
- LinBox - C++ library for exact, high-performance linear algebra☆97Updated 3 weeks ago
- String Matching Algorithms Research Tool☆107Updated last year
- A programming language to write bitsliced ciphers☆58Updated last year
- AOCL-LibM☆121Updated last week
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- LiDIA --- A library for computational number theory, developed 1994-2004 by Johannes Buchmann's group at TU Darmstadt, relicensed to GPL …☆30Updated 6 months ago
- ✈️ PTHash is a fast and compact minimal perfect hash function.☆244Updated this week
- Swing, divide and conquer the factorial!☆81Updated 3 years ago
- configurable, high-performance SAT solver, implementing incremental solving interface of MiniSat and IPASIR. Based on MiniSat (minisat.se…☆41Updated last year
- An evolutionary approach to find small and low latency sorting networks☆72Updated this week
- Repository for the current status of the LESS submission☆12Updated this week
- Double precision SIMD-oriented Fast Mersenne Twister☆42Updated 3 months ago
- Methods and Benchmarks for Random Numbers in a Range☆37Updated 7 years ago
- C library to compute the Hamming weight of arrays☆49Updated 6 years ago
- A basic implementation of the Small Primes Number-Theoretic Transform (NTT) multiplication algorithm.☆24Updated 8 years ago
- ☆14Updated last month
- Antic has been merged into FLINT -- use https://github.com/flintlib/flint/ instead☆62Updated 2 years ago
- Source code for GpuShareSat, a library for SAT solvers to use the GPU for clause sharing between CPU threads.☆34Updated 4 years ago
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- A Valgrind tool for Herbie☆96Updated 3 years ago
- Fast random number generators: Vectorized (SIMD) version of xorshift128+☆119Updated 5 years ago
- Clockwork: A Modular Arithmetic library for C++☆11Updated this week
- SAT instance generator for SHA-1☆49Updated 4 years ago
- XKCP-extracted code for KangarooTwelve (K12)☆52Updated this week
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆129Updated 9 months ago