Two fast implementations of the “minimal standard” random number generator
暂无分享,去创建一个
Although superficially time-consuming, on 32-bit computers the minimal standard random number generator can be implemented with surprising economy.
[1] P. A. W. Lewis,et al. A Pseudo-Random Number Generator for the System/360 , 1969, IBM Syst. J..
[2] S. K. Park,et al. Random number generators: good ones are hard to find , 1988, CACM.
[3] W. H. Payne,et al. Coding the Lehmer pseudo-random number generator , 1969, CACM.