On the adequacy of pseudy-random number generators (or: How big a period do we need?)

DOI10.1016/0167-6377(86)90092-1zbMath0606.65002OpenAlexW1987467280MaRDI QIDQ1084828

David C. Heath

Publication date: 1986

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(86)90092-1

zbMATH Keywords

pseudorandom number generatorlinear congruential generatorstatistical tests of randomnessdiscrete event simulation

Mathematics Subject Classification ID

Parametric hypothesis testing (62F03) Random number generation in numerical analysis (65C10)

Related Items (1)

On the structure of digraphs of polynomial transformations over finite commutative rings with unity

Cites Work

• The serial test for pseudo-random numbers generated by the linear congruential method
• Limit Theorems for Some Occupancy and Sequential Occupancy Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the adequacy of pseudy-random number generators (or: How big a period do we need?)