Theory and application of Marsaglia's monkey test for pseudorandom number generators

Authors:
Ora E. Percus;Paula A. Whitlock
Affiliations:
New York Univ., New York, NY;Brooklyn College, Brooklyn, NY
Venue:
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Year:
1995

Citing 4
Cited 5

Efficient and portable combined Tausworthe random number generators

ACM Transactions on Modeling and Computer Simulation (TOMACS)
Testing random number generators

WSC '92 Proceedings of the 24th conference on Winter simulation
The Runs Up-and-Down Performance of Tausworthe Pseudo-Random Number Generators

Journal of the ACM (JACM)
Fortran Tausworthe pseudorandom number generator

Communications of the ACM

Exact and Efficient Computation of the Expected Number of Missing and Common Words in Random Texts

COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Visualization of K -Tuple Distribution in Procaryote Complete Genomes and Their Randomized Counterparts

CSB '02 Proceedings of the IEEE Computer Society Conference on Bioinformatics
Combinatorics of periods in strings

Journal of Combinatorial Theory Series A
Quasi-random integration in high dimensions

Mathematics and Computers in Simulation
TestU01: A C library for empirical testing of random number generators

ACM Transactions on Mathematical Software (TOMS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

A theoretical analysis is given for a new test, the “Monkey” test, for pseudorandom number sequences, which was proposed by Marsaglia. Selected results, using the test on several pseudorandom number generators in the literature, are also presented.