Pages that link to "Item:Q4876061"

The following pages link to A search for good multiple recursive random number generators (Q4876061):

Displaying 32 items.

• Finding the best portable congruential random number generators (Q310292) (← links)
• Efficient computer search of large-order multiple recursive pseudo-random number generators (Q421831) (← links)
• Simulated division with approximate factoring for the multiple recursive generator with both unrestricted multiplier and non-Mersenne prime modulus (Q597246) (← links)
• Upper bounds in spectral test for multiple recursive random number generators with missing terms (Q679270) (← links)
• Distribution of lattice points (Q854700) (← links)
• A revised forward and backward heuristic for two-term multiple recursive random number generators (Q870156) (← links)
• An analysis of linear congruential random number generators when multiplier restrictions exist (Q881543) (← links)
• Tests of randomness by the gambler's ruin algorithm (Q924400) (← links)
• The additive congruential random number generator -- a special case of a multiple recursive generator (Q929939) (← links)
• Several extensively tested multiple recursive random number generators (Q1125014) (← links)
• Good random number generators are (not so) easy to find (Q1299872) (← links)
• Systematic searches for good multiple recursive random number generators (Q1366700) (← links)
• Effective and efficient restriction on producing the multipliers for the multiple recursive random number generator (Q1767848) (← links)
• Uniform random number generation (Q1805480) (← links)
• Random number generators with long period and sound statistical properties (Q1806585) (← links)
• Lower bounds in spectral tests for vectors of nonsuccessive values produced by multiple recursive generator with some zero multipliers (Q1876483) (← links)
• A brief and understandable guide to pseudo-random number generators and specific models for security (Q2137825) (← links)
• An exhaustive analysis of two-term multiple recursive random number generators with efficient multipliers (Q2491658) (← links)
• Bad lattice points (Q2572941) (← links)
• The revised recursive reduction for efficiently generating random numbers (Q2740951) (← links)
• Large-Order Multiple Recursive Generators with Modulus 2³¹ − 1 (Q2815474) (← links)
• An exhaustive analysis of two-term multiple recursive random number generators with double precision floating point restricted multipliers (Q2895975) (← links)
• A 4217th-order multiple recursive random number generator with modulus 2³¹– 69 (Q3008561) (← links)
• Full period of a multiple recursive random number generator with generalized Mersenne prime number (Q3060878) (← links)
• Tables of linear congruential generators of different sizes and good lattice structure (Q4221978) (← links)
• Implementing a multiple recursive generator with mersenne prime modulus (Q4521207) (← links)
• A statistical analysis of the screening measure of multiple recursive random number generators of orders one and two (Q4534179) (← links)
• Orbits and lattices for linear random number generators with composite moduli (Q4878541) (← links)
• Searching for good two-term multiple recursive random number generators using a backpropagation algorithm (Q5490140) (← links)
• A new heuristic for second-order multiple recursive random number generator (Q5696454) (← links)
• A Repetition Test for Pseudo-Random Number Generators (Q5757064) (← links)
• 64-bit and 128-bit DX random number generators (Q5962002) (← links)