Scrambling additive lagged-Fibonacci generators
From MaRDI portal
Publication:2171925
DOI10.1515/MCMA-2022-2115zbMATH Open1497.65012OpenAlexW4293371001MaRDI QIDQ2171925FDOQ2171925
Michael Mascagni, Haifa Aldossari
Publication date: 12 September 2022
Published in: Monte Carlo Methods and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/mcma-2022-2115
Recommendations
- Scrambled linear pseudorandom number generators
- Feistel-inspired scrambling improves the quality of linear congruential generators
- Lagged Fibonacci random number generators for distributed memory parallel computers
- An experimental exploration of Marsaglia's \texttt{xorshift} generators, scrambled
- Stochastic investigations of pseudo-random number generators
Random number generation in numerical analysis (65C10) Pseudo-random numbers; Monte Carlo methods (11K45)
Cites Work
- Scrambled Linear Pseudorandom Number Generators
- Title not available (Why is that?)
- TestU01
- Handbook of computational statistics. Concepts and methods.
- A fast, high quality, and reproducible parallel lagged-Fibonacci pseudorandom number generator
- Improving a Poor Random Number Generator
- Title not available (Why is that?)
- An Experimental Exploration of Marsaglia's xorshift Generators, Scrambled
- Uniform Random Number Generators
- Feistel-inspired scrambling improves the quality of linear congruential generators
- Common defects in initialization of pseudorandom number generators
Cited In (1)
Uses Software
This page was built for publication: Scrambling additive lagged-Fibonacci generators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2171925)