ACM Home Page
Please provide us with feedback. Feedback
Two fast implementations of the “minimal standard” random number generator
Full text PdfPdf (206 KB)
Source
Communications of the ACM archive
Volume 33 ,  Issue 1  (January 1990) table of contents
Pages: 87 - 88  
Year of Publication: 1990
ISSN:0001-0782
Author
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 61,   Citation Count: 13
Additional Information:

abstract   references   cited by   index terms   review  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/76372.76379
What is a DOI?

ABSTRACT

Although superficially time-consuming, on 32-bit computers the minimal standard random number generator can be implemented with surprising economy.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Lewis, P.A., Goodman, A.S., and Miller, J.M. A pseudo.random number generator for the System/360. IBM Syst. J. 8, 2 (1969), 136-146.
2
3

CITED BY  13


REVIEW

"William J. J. Rey : Reviewer"

Although not restricted to the well-known multiplicative linear congruential generator sn+1=16807snmod 231-1, more...