Serial Correlation in the Generation of Pseudo-Random Numbers
Journal of the ACM (JACM)
A New Pseudo-Random Number Generator
Journal of the ACM (JACM)
Notes on a New Pseudo-Random Number Generator
Journal of the ACM (JACM)
Mixed Congruential Random Number Generators for Decimal Machines
Journal of the ACM (JACM)
A 48-bit pseudo-random generator
Communications of the ACM
Screening tests of pseudorandom number generators on IBM PC's and compatibles
WSC '85 Proceedings of the 17th conference on Winter simulation
Uniform Random Number Generators
Journal of the ACM (JACM)
Some New Results in Pseudo-Random Number Generation
Journal of the ACM (JACM)
Testing a random number generator
Communications of the ACM
A comparison of the correlational behavior of random number generators for the IBM 360
Communications of the ACM
The self-judgment method of curve fitting
Communications of the ACM
A new uniform pseudorandom number generator
Communications of the ACM
Algorithm 286: Examination scheduling
Communications of the ACM
The GPSS/360 random number generator
Proceedings of the second conference on Applications of simulations
A comparative analysis of two concepts in the generation of uniform pseudo-random numbers
ACM '67 Proceedings of the 1967 22nd national conference
The relationship between the multiplicative and mixed generators modulo 2b
ACM SIGSIM Simulation Digest
Loop Properties and Controllability of Linear Congruential Sequences
IEEE Transactions on Computers
Fast "infinite-key" privacy transformation for resource-sharing systems
AFIPS '70 (Fall) Proceedings of the November 17-19, 1970, fall joint computer conference
Hi-index | 0.08 |
Random number generators of the mixed congruential type have recently been proposed. They appear to have some advantages over those of the multiplicative type, except that their statistical behavior is unsatisfactory in some cases. It is shown theoretically that a certain class of these mixed generators should be expected to fail statistical tests for randomness. Extensive testing confirms this hypothesis and makes possible a more precise definition of the unsatisfactory class. It is concluded that the advantages of mixed generators can be realized only in special circumstances. On machines with relatively short multiplication times the multiplicative generators are to be preferred.