References
- Fincke , U. and Pohst , M. 1985 . Improved methods for calculating vectors of short length in a lattice, including a complexity analysis . Mathematics of Computation , 44 : 463 – 471 .
- Fishman , G. S. 1990 . Multiplicative congruential random number generators with modulus 2β: an exhaustive analysis for β = 32 and a partial analysis for β = 48 . Mathematics of Computation , 54 : 331 – 344 .
- Fishman , G. S. and Moore III , L. R. 1986 . An exhaustive analysis of multiplicative congruential random number generators with modulus 231 − 1 . SIAM Journal on Scientific and Statistical Computing , 7 : 24 – 45 .
- Kao , C. and Tang , H. C. 1997 . Systematic searches for good multiple recursive random number generators . Computers & Operations Research , 24 : 899 – 905 .
- Knuth , D. E. 1997 . The Art of Computer Programming – Semi-numerical Algorithms , 3rd , Reading MA : Addison-Wesley . Vol. 2
- L'Ecuyer , P. 1992 . Testing random number generators . in Proceeding of the 1992 Winter Simulation Conference , : 305 – 313 .
- L'Ecuyer , P. , Blouin , F. and Couture , R. 1993 . A search for good multiple recursive random number generators . ACM Transactions on Modelling and Computer Simulation , 3 : 87 – 98 .
- Mann , H. B. and Wald , A. 1942 . On the choice of the number of intervals in the application of the chi-square test . Annals of Mathematical Statistics , 13 : 306 – 317 .
- Marsaglia , G. and Zaman , A. 1993 . Monkey tests for random number generators . Computers and Mathematics with Applications , 26 : 1 – 10 .
- 1991 . SAS Procedures Guide Release 6.03 Edition , NC, USA : Cary . SAS Institute Inc
- Tang , H. C. and Kao , C. 2004 . “ Searching for good multiple recursive random number generators via a genetic algorithm ” . In INFORMS Journal on Computing to appear