Thoughts on pseudorandom number generators
- 1 July 1990
- journal article
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 31 (1) , 153-163
- https://doi.org/10.1016/0377-0427(90)90346-2
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Iterative simulation methodsJournal of Computational and Applied Mathematics, 1990
- Random number generation with the recursion Xt = Xt−3p ⊕ Xt−3qJournal of Computational and Applied Mathematics, 1990
- Random number generators: good ones are hard to findCommunications of the ACM, 1988
- Matrices and the structure of random number sequencesLinear Algebra and its Applications, 1985
- Correction: Algorithm AS 183: An Efficient and Portable Pseudo-Random Number GeneratorJournal of the Royal Statistical Society Series C: Applied Statistics, 1984
- The k -distribution of generalized feedback shift register pseudorandom numbersCommunications of the ACM, 1983
- Algorithm AS 183: An Efficient and Portable Pseudo-Random Number GeneratorJournal of the Royal Statistical Society Series C: Applied Statistics, 1982
- A More Portable Fortran Random Number GeneratorACM Transactions on Mathematical Software, 1979
- Improving a Poor Random Number GeneratorACM Transactions on Mathematical Software, 1976
- Coding the Lehmer pseudo-random number generatorCommunications of the ACM, 1969