A study of 64-bit multipliers for Lehmer pseudorandom number generators
From MaRDI portal
Publication:5948248
DOI10.1016/S0010-4655(97)00052-0zbMath0980.65007OpenAlexW2086514891MaRDI QIDQ5948248
Kenneth G. Hamilton, Iosif G. Dyadkin
Publication date: 11 November 2001
Published in: Computer Physics Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0010-4655(97)00052-0
Related Items (3)
Finding the best portable congruential random number generators ⋮ Distribution of lattice points ⋮ A family of enhanced Lehmer random number generators, with hyperplane suppression, and direct support for certain physical applications
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Uses and abuses of statistical simulation
- Monkey tests for random number generators
- Pseudorandom number generators for personal computers. II
- A portable high-quality random number generator for lattice field theory simulations
- Pseudorandom number generators for Salford FTN77
- A review of pseudorandom number generators
- Pseudorandom number generators for personal computers
- Regularities in congruential random number generators
- Algorithm AS 193: A Revised Algorithm for the Spectral Test
- The Generation of Multiple Independent Sequences of Pseudorandom Numbers
- The lattice structure of pseudo-random number generators
- An Exhaustive Analysis of Multiplicative Congruential Random Number Generators with Modulus $2^{31} - 1$
- Improving a Poor Random Number Generator
- Multiplicative Congruential Random Number Generators with Modulus 2 β : An Exhaustive Analysis for β = 32 and a Partial Analysis for β = 48
- A Convenient Method for Generating Normal Variables
- Fourier Analysis of Uniform Random Number Generators
- RANDOM NUMBERS FALL MAINLY IN THE PLANES
- Choosing a Point from the Surface of a Sphere
This page was built for publication: A study of 64-bit multipliers for Lehmer pseudorandom number generators
