An Exhaustive Analysis of Multiplicative Congruential Random Number Generators with Modulus $2^{31} - 1$
- 1 January 1986
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific and Statistical Computing
- Vol. 7 (1) , 24-45
- https://doi.org/10.1137/0907002
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- Optimal multipliers for pseudo-random number generation by the linear congruential methodBIT Numerical Mathematics, 1983
- How to calculate shortest vectors in a latticeMathematics of Computation, 1975
- The Structure of Linear Congruential SequencesPublished by Elsevier ,1972
- The lattice structure of multiplicative congruential pseudo-random vectorsMathematics of Computation, 1971
- RANDOM NUMBERS FALL MAINLY IN THE PLANESProceedings of the National Academy of Sciences, 1968
- Fourier Analysis of Uniform Random Number GeneratorsJournal of the ACM, 1967
- An Introduction to the Geometry of NumbersPublished by Springer Nature ,1959
- On Several Statistics Related to Empirical Distribution FunctionsThe Annals of Mathematical Statistics, 1958
- A Test of Goodness of FitJournal of the American Statistical Association, 1954
- Asymptotic Theory of Certain "Goodness of Fit" Criteria Based on Stochastic ProcessesThe Annals of Mathematical Statistics, 1952