Pages that link to "Item:Q1084828"
From MaRDI portal
The following pages link to On the adequacy of pseudy-random number generators (or: How big a period do we need?) (Q1084828):
Displaying 11 items.
- Long-range correlations in linear and non-linear random number generators (Q749148) (← links)
- Efficient, perfect polynomial random number generators (Q809536) (← links)
- An aperiodic pseudorandom number generator (Q920537) (← links)
- Random walks arising in random number generation (Q1091018) (← links)
- Uniformly distributed sequences in computer algebra or how to construct program generators of random numbers (Q1269954) (← links)
- On the structure of digraphs of polynomial transformations over finite commutative rings with unity (Q1669585) (← links)
- Definition of necessary length of random sequences at execution of the empirical tests (criterion \(\chi^2\)). (Q1880673) (← links)
- On a possible error of type II in statistical evaluation of pseudo-random number generators (Q1909596) (← links)
- Construction of a long-period nonalgebraic and nonrecursive pseudorandom number generator (Q3148746) (← links)
- Random number generators based on permutations can pass the collision test (Q3383141) (← links)
- Theory and application of Marsaglia's monkey test for pseudorandom number generators (Q4875972) (← links)