Pseudorandom number generators for Salford FTN77
From MaRDI portal
Publication:1365911
DOI10.1016/0010-4655(94)90122-8zbMath0878.65008OpenAlexW2041122289MaRDI QIDQ1365911
Publication date: 9 September 1997
Published in: Computer Physics Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0010-4655(94)90122-8
Random number generation in numerical analysis (65C10) Packaged methods for numerical algorithms (65Y15) Pseudo-random numbers; Monte Carlo methods (11K45)
Related Items (4)
A universal GFSR random number generator for personal computers ⋮ A comparative study of some pseudorandom number generators ⋮ A family of enhanced Lehmer random number generators, with hyperplane suppression, and direct support for certain physical applications ⋮ A study of 64-bit multipliers for Lehmer pseudorandom number generators
Uses Software
Cites Work
- Unnamed Item
- Toward a universal random number generator
- A new class of random number generators
- Pseudorandom number generators for personal computers. II
- A random number generator for PC's
- A review of pseudorandom number generators
- Pseudorandom number generators for personal computers
- Regularities in congruential random number generators
- Empirical Tests of an Additive Random Number Generator
- The lattice structure of pseudo-random number generators
- Efficient and portable combined Tausworthe random number generators
- Random Numbers Generated by Linear Recurrence Modulo Two
- RANDOM NUMBERS FALL MAINLY IN THE PLANES
- Generalized Feedback Shift Register Pseudorandom Number Algorithm
This page was built for publication: Pseudorandom number generators for Salford FTN77