An Exhaustive Analysis of Multiplicative Congruential Random Number Generators with Modulus $2^{31} - 1$
From MaRDI portal
Publication:3740108
DOI10.1137/0907002zbMath0603.65003OpenAlexW2022349318MaRDI QIDQ3740108
George S. Fishman, Louis R. Moore
Publication date: 1986
Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0907002
Related Items
A parallel search for good lattice points using LLL-spectral tests, A statistical analysis of the screening measure of multiple recursive random number generators of orders one and two, Stochastic volatility in asset prices. Estimation with simulated maximum likelihood, Feistel-inspired scrambling improves the quality of linear congruential generators, Several extensively tested random number generators, Decomposition with simulated division for efficiently generating random numbers, A brief and understandable guide to pseudo-random number generators and specific models for security, Heuristics for the multi-resource generalized assignment problem, A New Test of Randomness for Lehmer Generators Based on the Manhattan Distance Between Pairs of Consecutive Random Numbers, A likelihood ratio test for three-mode singular values: Upper percentiles and an application to three-way ANOVA, Distribution of lattice points, 32-bit multipliers for linear congruential random number generators, Systematic searches for good multiple recursive random number generators, A revised forward and backward heuristic for two-term multiple recursive random number generators, Simulated division with approximate factoring for the multiple recursive generator with both unrestricted multiplier and non-Mersenne prime modulus, A search for good pseudo-random number generators: survey and empirical studies, Several extensively tested multiple recursive random number generators, An analysis of linear congruential random number generators when multiplier restrictions exist, Symmetry property of multiplicative congruential random number generator in chi-square test, Efficient computer search of large-order multiple recursive pseudo-random number generators, Survey on hardware implementation of random number generators on FPGA: theory and experimental analyses, Thoughts on pseudorandom number generators, Criteria for the assessment of random number generators, Universal homophonic coding scheme using differential encoding and interleaving, An exhaustive analysis of prime modulus multiplicative congruential random number generators with modulus smaller than 215, A new heuristic for second-order multiple recursive random number generator, Recent trends in random number and random vector generation, Tests based on sum-functions of spacings for uniform random numbers, Upper bounds in spectral test for multiple recursive random number generators with missing terms, Parallel use of multiplicative congruential random number generators, A study of 64-bit multipliers for Lehmer pseudorandom number generators, Multivariate Estimation of Conditional Performance Measures in Regenerative Simulation, Testing random number generators by numerical modeling of an exactly solvable problem, Uniform random number generation, Random number generators with long period and sound statistical properties, Large-Order Multiple Recursive Generators with Modulus 231 − 1, Upper bound on the center density of a multiple recursive random number generator, Searching for good two-term multiple recursive random number generators using a backpropagation algorithm, Good random number generators are (not so) easy to find, Tables of linear congruential generators of different sizes and good lattice structure, JEROBOAM
Uses Software
