Multiplicative, congruential random-number generators with multiplier ± 2 k 1 ± 2 k 2 and modulus 2 p - 1
- 1 June 1997
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 23 (2) , 255-265
- https://doi.org/10.1145/264029.264056
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Random Number Generators on Vector Supercomputers and Other Advanced ArchitecturesSIAM Review, 1990
- Random number generators: good ones are hard to findCommunications of the ACM, 1988
- An Exhaustive Analysis of Multiplicative Congruential Random Number Generators with Modulus $2^{31} - 1$SIAM Journal on Scientific and Statistical Computing, 1986
- A very fast shift-register sequence random number generatorJournal of Computational Physics, 1981
- A More Portable Fortran Random Number GeneratorACM Transactions on Mathematical Software, 1979
- Coding the Lehmer pseudo-random number generatorCommunications of the ACM, 1969