Improving a Poor Random Number Generator

DOI10.1145/355666.355670zbMath0317.65001OpenAlexW2050179204MaRDI QIDQ4078975

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

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

Related Items (10)

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

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