Two fast implementations of the “minimal standard” random number generator
- 3 January 1990
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 33 (1), 87-88
- https://doi.org/10.1145/76372.76379
Abstract
Although superficially time-consuming, on 32-bit computers the minimal standard random number generator can be implemented with surprising economy.Keywords
This publication has 3 references indexed in Scilit:
- Random number generators: good ones are hard to findCommunications of the ACM, 1988
- Coding the Lehmer pseudo-random number generatorCommunications of the ACM, 1969
- A pseudo-random number generator for the System/360IBM Systems Journal, 1969