Pages that link to "Item:Q2740951"

The following pages link to The revised recursive reduction for efficiently generating random numbers (Q2740951):

Displaying 8 items.

• Random arithmetic formulas can be reconstructed efficiently (Q488050) (← links)
• Simulated division with approximate factoring for the multiple recursive generator with both unrestricted multiplier and non-Mersenne prime modulus (Q597246) (← links)
• A revised forward and backward heuristic for two-term multiple recursive random number generators (Q870156) (← links)
• Optimized random number generation in an interval (Q989468) (← links)
• The use of Chebyshev mixing to generate pseudo-random numbers (Q1083169) (← links)
• Bifurcating distributive system using Monte Carlo method (Q1196508) (← links)
• Improved bounds in the multiple-recursive matrix method for pseudorandom number and vector generation (Q1383501) (← links)
• An optimised implementation of MWC pseudo-random number generator analyzed with the NIST statistical test suite for randomness (Q2835142) (← links)