Home → Magazine Archive → January 1990 (Vol. 33, No. 1) → Two fast implementations of the “minimal standard”... → Abstract

Two fast implementations of the “minimal standard” random number generator

By David F. Carta

Communications of the ACM, Vol. 33 No. 1, Pages 87-88
10.1145/76372.76379


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

The full text of this article is premium content

0 Comments

No entries found