Upper bound on the center density of a multiple recursive random number generator
From MaRDI portal
Publication:2832938
DOI10.1080/09720529.2012.10698393zbMath1353.65003OpenAlexW2066977165MaRDI QIDQ2832938
Publication date: 15 November 2016
Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09720529.2012.10698393
Cites Work
- An analysis of linear congruential random number generators when multiplier restrictions exist
- A method of systematic search for optimal multipliers in congruential random number generators
- An exhaustive analysis of two-term multiple recursive random number generators with efficient multipliers
- Theoretical analyses of forward and backward heuristics of multiple recursive random number generators
- Searching for Good Multiple Recursive Random Number Generators via a Genetic Algorithm
- An Exhaustive Analysis of Multiplicative Congruential Random Number Generators with Modulus $2^{31} - 1$
- Tables of linear congruential generators of different sizes and good lattice structure
- Unnamed Item
- Unnamed Item
This page was built for publication: Upper bound on the center density of a multiple recursive random number generator