An exhaustive analysis of multiplicative congruential random number generators with modulus 231-1
SIAM Journal on Scientific and Statistical Computing
Random number generators: good ones are hard to find
Communications of the ACM
Random number generation and quasi-Monte Carlo methods
Random number generation and quasi-Monte Carlo methods
Computation of critical distances within multiplicative congruential pseudorandom number sequences
Journal of Computational and Applied Mathematics
Testing random number generators
WSC '92 Proceedings of the 24th conference on Winter simulation
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Digital inversive pseudorandom numbers
ACM Transactions on Modeling and Computer Simulation (TOMACS)
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Gambling tests for pseudorandom number generators
Mathematics and Computers in Simulation - IMACS sponsored Special issue on the second IMACS seminar on Monte Carlo methods
Uniform random number generators: a review
Proceedings of the 29th conference on Winter simulation
The weighted spectral test: diaphony
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on uniform random number generation
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
Linear and inversive pseudorandom numbers for parallel and distributed simulation
PADS '98 Proceedings of the twelfth workshop on Parallel and distributed simulation
A rejection technique for sampling from log-concave multivariate distributions
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Uniform random number generators
Proceedings of the 30th conference on Winter simulation
Empirical investigation of the Markov reference model
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Monkeys, gambling, and return times: assessing pseudorandomness
Proceedings of the 31st conference on Winter simulation: Simulation---a bridge to the future - Volume 1
Caching and Scheduling for Broadcast Disk Systems
Journal of Experimental Algorithmics (JEA)
Empirical evidence concerning AES
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Dynamic election-based sensing and routing in wireless sensor networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
| Hi-index | 0.00 |
We present results from a series of empirical tests of pseudorandom number generators. The tests cover a broad range of designs due to bit-oriented, efficient test statistics and a testing procedure inwhich we vary the sample size, dimension, and the statistics' resolution within vast bounds. Inversive generation methods pass the tests for a broader range of thest parameters thatn linear generators with equal period legth. The results exemplify how the lattice structure of linear generatorsf can affect a stochastic simulation and suggest the use of inversive generators for cross-checking the results.