Some New Results in Pseudo-Random Number Generation
Journal of the ACM (JACM)
The art of simulation
Efficient and portable combined random number generators
Communications of the ACM
Random number generators: good ones are hard to find
Communications of the ACM
A fast uniform astronomical random number generator
ACM SIGSAC Review
Two fast implementations of the “minimal standard” random number generator
Communications of the ACM
Implementing a random number package with splitting facilities
ACM Transactions on Mathematical Software (TOMS)
A portable random number generator well suited for the rejection method
ACM Transactions on Mathematical Software (TOMS)
Multiplicative, congruential random-number generators with multiplier ± 2k1 ± 2k2 and modulus 2p - 1
ACM Transactions on Mathematical Software (TOMS)
Bad subsequences of well-known linear congruential pseudorandom number generators
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on uniform random number generation
A More Portable Fortran Random Number Generator
ACM Transactions on Mathematical Software (TOMS)
Communications of the ACM - Special issue on computer augmented environments: back to the real world
Generalized Lehmer-Tausworthe random number generators
ACM-SE 30 Proceedings of the 30th annual Southeast regional conference
An exhaustive search for optimal multipliers
WSC '84 Proceedings of the 16th conference on Winter simulation
A system of high-dimensional, efficient, long-cycle and portable uniform random number generators
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Efficient and portable multiple recursive generators of large order
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Eliminating Conflict Misses Using Prime Number-Based Cache Indexing
IEEE Transactions on Computers
Information Processing Letters
Some test results on the SIMSCRIPT II. 5 and SIMPL/1 pseudorandom number generators
ACM SIGSIM Simulation Digest
A pseudo-random number generator for the System/360
IBM Systems Journal
Information Processing Letters
Efficient and formally proven reduction of large integers by small moduli
ACM Transactions on Mathematical Software (TOMS)
| Hi-index | 48.27 |
An algorithm and coding technique is presented for quick evaluation of the Lehmer pseudo-random number generator modulo 2 ** 31 - 1, a prime Mersenne number which produces 2 ** 31 - 2 numbers, on a p-bit (greater than 31) computer. The computation method is extendible to limited problems in modular arithmetic. Prime factorization for 2 ** 61 - 2 and a primitive root for 2 ** 61 - 1, the next largest prime Mersenne number, are given for possible construction of a pseudo-random number generator of increased cycle length.