Two Fast Implementations of the “Minimal Standard” Random Number Generator

36Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.

Abstract

Although superficially time-consuming, on 32-bit computers the minimal standard random number generator can be implemented with surprising economy. © 1990, ACM. All rights reserved.

Author supplied keywords

Cite

CITATION STYLE

APA

Carta, D. F. (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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free