An exhaustive analysis of two-term multiple recursive random number generators with efficient multipliers
From MaRDI portal
Publication:2491658
DOI10.1016/j.cam.2005.06.001zbMath1092.65003OpenAlexW1977034860MaRDI QIDQ2491658
Publication date: 29 May 2006
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2005.06.001
Related Items (4)
An exhaustive analysis of two-term multiple recursive random number generators with double precision floating point restricted multipliers ⋮ Searching for good two-term fifth-order multiple recursive random number generators ⋮ An analysis of linear congruential random number generators when multiplier restrictions exist ⋮ Upper bound on the center density of a multiple recursive random number generator
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Upper bounds in spectral test for multiple recursive random number generators with missing terms
- Systematic searches for good multiple recursive random number generators
- Effective and efficient restriction on producing the multipliers for the multiple recursive random number generator
- Lower bounds in spectral tests for vectors of nonsuccessive values produced by multiple recursive generator with some zero multipliers
- Searching for Good Multiple Recursive Random Number Generators via a Genetic Algorithm
- Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
- An Introduction to the Geometry of Numbers
- An Analytic Approach to Secure Pseudo-Random Generation
- Pseudo-random Number Generator by Means of Irrational Rotation
- A search for good multiple recursive random number generators
- Fourier Analysis of Uniform Random Number Generators
This page was built for publication: An exhaustive analysis of two-term multiple recursive random number generators with efficient multipliers
