Abstract
Although superficially time-consuming, on 32-bit computers the minimal standard random number generator can be implemented with surprising economy.
Keywords
Generator (circuit theory)Computer scienceRandom number generationImplementationArithmeticRandom seedPseudorandom number generatorParallel computingAlgorithmMathematicsProgramming languagePower (physics)
Related Publications
Efficient and portable combined random number generators
In this paper we present an efficient way to combine two or more Multiplicative Linear Congruential Generators (MLCGs) and propose several new generators. The individual MLCGs, ...
VSEARCH: a versatile open source tool for metagenomics
Background VSEARCH is an open source and free of charge multithreaded 64-bit tool for processing and preparing metagenomics, genomics and population genomics nucleotide sequence...
Publication Info
- Year
- 1990
- Type
- article
- Volume
- 33
- Issue
- 1
- Pages
- 87-88
- Citations
- 48
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
48
OpenAlex
Cite This
David F. Carta
(1990).
Two fast implementations of the “minimal standard” random number generator.
Communications of the ACM
, 33
(1)
, 87-88.
https://doi.org/10.1145/76372.76379
Identifiers
- DOI
- 10.1145/76372.76379