Pages that link to "Item:Q1116259"

The following pages link to Optimal multipliers for linear congruential pseudorandom number generators with prime moduli (Q1116259):

Displaying 10 items.

• Simulated division with approximate factoring for the multiple recursive generator with both unrestricted multiplier and non-Mersenne prime modulus (Q597246) (← links)
• Recent trends in random number and random vector generation (Q1176851) (← links)
• Optimal multipliers for linear congruential pseudo-random number generators with prime moduli: Parallel computation and properties (Q1293242) (← links)
• Optimal characteristic polynomials for digital multistep pseudorandom numbers (Q1822442) (← links)
• A brief and understandable guide to pseudo-random number generators and specific models for security (Q2137825) (← links)
• An optimised implementation of MWC pseudo-random number generator analyzed with the NIST statistical test suite for randomness (Q2835142) (← links)
• (Q3334857) (← links)
• An exhaustive analysis of prime modulus multiplicative congruential random number generators with modulus smaller than 2¹⁵ (Q4355589) (← links)
• Implementing 64-bit Maximally Equidistributed F ₂ -Linear Generators with Mersenne Prime Period (Q4581398) (← links)
• 32-bit multipliers for linear congruential random number generators (Q5307742) (← links)