Multiplicative, congruential random-number generators with multiplier ± 2 k 1 ± 2 k 2
DOI10.1145/264029.264056zbMATH Open0887.65003OpenAlexW2031859776MaRDI QIDQ4375504FDOQ4375504
Authors: Pei-Chi Wu 
Publication date: 8 February 1998
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: http://www.acm.org/pubs/contents/journals/toms/1997-23/
Recommendations
- An Exhaustive Analysis of Multiplicative Congruential Random Number Generators with Modulus $2^{31} - 1$
- A Statistical Evaluation of Multiplicative Congruential Random Number Generators with Modulus 2 31 - 1
- Multiplicative Congruential Random Number Generators with Modulus 2 β : An Exhaustive Analysis for β = 32 and a Partial Analysis for β = 48
- Random number generators with long period and sound statistical properties
cycle lengthempirical testsspectral testsfrequency testrun testmaximum-of-\(t\) testmultiplicative, congruential random number generators
Cited In (21)
- Acceleration of linear congruent generators
- Numerical evaluation of a multi-stream pseudo-random number generator
- Bit-parallel random number generation for discrete uniform distributions
- Several extensively tested random number generators
- Large-order multiple recursive generators with modulus \(2^{31}-1\)
- Relative merits of random number generators: Indirect approach
- A brief and understandable guide to pseudo-random number generators and specific models for security
- Some good multipliers for random number generators for 16-bit microcomputers
- Improving random number generators in the Monte Carlo simulations via twisting and combining
- Parallel use of multiplicative congruential random number generators
- Decomposition with simulated division for efficiently generating random numbers
- A study of 64-bit multipliers for Lehmer pseudorandom number generators
- Title not available (Why is that?)
- A Statistical Evaluation of Multiplicative Congruential Random Number Generators with Modulus 2 31 - 1
- Multiplicative Congruential Random Number Generators with Modulus 2 β : An Exhaustive Analysis for β = 32 and a Partial Analysis for β = 48
- A method of systematic search for optimal multipliers in congruential random number generators
- An exhaustive analysis of prime modulus multiplicative congruential random number generators with modulus smaller than 215
- A 4217th-order multiple recursive random number generator with modulus \(2^{31} - 69\)
- Pseudorandom number generators for supercomputers and classical computers: A practical introduction
- The multiple prime random number generator
- An Exhaustive Analysis of Multiplicative Congruential Random Number Generators with Modulus $2^{31} - 1$
This page was built for publication: Multiplicative, congruential random-number generators with multiplier ± 2 k 1 ± 2 k 2
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4375504)
