Improving a Poor Random Number Generator

DOI10.1145/355666.355670MaRDI QIDQ4078975zbMATH OpenOpenAlexFDO

Authors Carter Bays, Stephen D. Durham

Publication date 1976

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/355666.355670

Mathematics Subject Classification ID

Statistical distribution theory (62E99) Random number generation in numerical analysis (65C10)

Cited in

(11)

• A fast random number generator for the Intel Paragon supercomputer
• A brief and understandable guide to pseudo-random number generators and specific models for security
• Scrambling additive lagged-Fibonacci generators
• Feistel-inspired scrambling improves the quality of linear congruential generators
• A random number generator for microprocessors
• A study of 64-bit multipliers for Lehmer pseudorandom number generators
• Developments in secure random number generators
• An exact D-dimensional Tsallis random number generator for generalized simulated annealing
• Improving random number generators on micro-computers
• Thoughts on pseudorandom number generators
• Tests of randomness by the gambler's ruin algorithm

This page was built for publication: Improving a Poor Random Number Generator

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4078975)