Randomization - Data Structures and Problem Solving Using Java - page 417

references

A good discussion of elementary random number generators is provided in [3].
The permutation algorithm is due to R. Floyd and is presented in [1]. The ran-
domized primality-testing algorithm is taken from [2] and [4]. More informa-
tion on random numbers is available in any good book on statistics or
probability.

J. Bentley, “Programming Pearls,” Communications of the ACM 30
(1987), 754-757.

1.

G. L. Miller, “Riemann's Hypothesis and Tests for Primality,” Journal of
Computer and System Science 13 (1976), 300-317.

2.

S. K. Park and K. W. Miller, “Random Number Generators: Good Ones
Are Hard to Find,” Communications of the ACM 31 (1988) 1192-1201.
(See also Technical Correspondence in 36 (1993) 105-110, which pro-
vides the value of A used in Figure 9.2.)

3.

4.

M. O. Rabin, “Probabilistic Algorithms for Testing Primality,” Journal of
Number Theory 12 (1980), 128-138.