References

1

P. A. M. Dirac. Proc. R. Soc. London Ser A, 123:734, 1929.

2

J. B. Anderson. In S. R. Langhoff, editor, Understanding Chemical Reactivity. Kluwer, Dordrecht, The Netherlans, 1995.

3

A. M. Ferrenberg, D. P. Landau, and Y. J. Wong. Monte Carlo simulations: Hidden errors from ``good'' random number generators. Phys. Rev. Let., 69:3382-3384, 1992.

4

P. Grassberger. On correlations in 'good' random number generators. Phys. Lett. A, 181(1):43-46, 1993.

5

W. Selke, A. L. Talapov, and L. N. Schur. Cluster-flipping Monte Carlo algorithm and correlations in ``good'' random number generators. JETP Lett., 58(8):665-668, 1993.

6

F. Schmid and N. B. Wilding. Errors in Monte Carlo simulations using shift register random number generators. Int. J. Mod. Phys. C, 6(6):781-787, 1995.

7

D. E. Knuth. The Art of Computer Programming, Vol. 2: Seminumerical Algorithms, Second edition. Addison-Wesley, Reading, Massachusetts, 1981.

8

W. H. Press, S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery. Numerical Recipes in FORTRAN. Cambridge University Press, New York, NY, second edition, 1994.

9

S. K. Park and K. W. Miller. Random number generators: good ones are hard to find. Comm. of the ACM, 31:1192-1201, 1988.

10

P. L'Ecuyer. Random numbers for simulation. Comm. of the ACM, 33:85-97, 1990.

11

G. Marsaglia. A current view of random number generators. In Computing Science and Statistics: Proceedings of the XVIth Symposium on the Interface, pages 3-10, 1985.

12

P. Coddington. Random number generators for parallel computers, NHSE Review, 1996 Volume, Second Issue.

13

M. Mascagni, S. A. Cuccaro, D. V. Pryor, and M. L. Robinson. Recent developments in parallel pseudorandom number generation. In D. E. Keyes, M. R. Leuze, L. R. Petzold, and D. A. Reed, editors, Proceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing, volume II, pages 524-529, Philadelphia, Pennsylvania, 1993. SIAM.

14

O. E. Percus and M. H. Kalos. Random number generators for MIMD parallel processors. J. of Par. Distr. Comput., 6:477-497, 1989.

15

R. P. Brent. Uniform random number generators for supercomputers. In Proceedings Fifth Australian Supercomputer Conference, pages 95-104. 5ASC Organizing Committee, 1992.

16

M. Mascagni. Parallel linear congruential generators with prime moduli. IMA Reprint 1470 and submitted, 1997.

17

M. Mascagni S. A. Cuccaro and D. V. Pryor. Techniques for testing the quality of parallel pseudorandom number generators. In Proceedings of the Seventh SIAM Conference on Parallel Processing for Scientific Computing, pages 279-284, Philadelphia, Pennsylvania, 1995. SIAM.

18

M. Kalos and P. Whitlock. Monte Carlo Methods. Wiley-Interscience, New York, 1986. Volume I: Basics.

19

D. M. Ceperley. Path integrals in the theory of condensed helium. Reviews of Modern Physics, 67(2):279-355, 1995.

20

D. H. Lehmer. Mathematical methods in large-scale computing units. In Proceedings of the 2nd Symposium on Large-Scale Digital Calculating Machinery, pages 141-146, Cambridge, Massachusetts, 1949. Harvard University Press.

21

T. G. Lewis and W. H. Payne. Generalized feedback shift register pseudorandom number algorithms. J. of the ACM, 20:456-468, 1973.

22

R. C. Tausworthe. Random numbers generated by linear recurrence modulo two. Math. Comput., 19:201-209, 1965.

23

S. W. Golomb. Shift Register Sequences. Aegean Park Press, Laguna Hills, California, 1982. Revised Edition.

24

J. L. Massey. Shift-register synthesis and bch decoding. IEEE Trans. Information Theory, 15:122-127, 1969.

25

H. Niederreiter. Random number generation and quasi-Monte Carlo methods. SIAM, Philadelphia, Pennsylvania, 1992.

26

R. P. Brent. On the periods of generalized Fibonacci recurrences. Math. Comput., 63:389-401, 1994.

27

G. Marsaglia and L.-H. Tsay. Matrices and the structure of random number sequences. Linear Alg. and Applic., 67:147-156, 1985.

28

M. Mascagni, S. A. Cuccaro, D. V. Pryor, and M. L. Robinson. A fast, high-quality, and reproducible lagged-Fibonacci pseudorandom number generator. J. Comput. Physics, 15:211-219, 1995.

29

M. Mascagni. A parallel non-linear Fibonacci pseudorandom number generator, 1997. Abstract, 45th SIAM Annual Meeting.

30

J. Eichenauer and J. Lehn. A nonlinear congruential pseudorandom number generator. Statist. Hefte, 37:315-326, 1986.

31

H. Niederreiter. Statistical independence of nonlinear congruential pseudorandom numbers. Montash. Math., 106:149-159, 1988.

32

H. Niederreiter. On a new class of pseudorandom numbers for simulation methods. J. Comput. Appl. Math., 56:159-167, 1994.

33

G. Marsaglia. Random numbers fall mainly in the planes. Proc. Nat. Acad. Sci. U.S.A., 62:25-28, 1968.

34

G. Marsaglia. The structure of linear congruential sequences. In S. K. Zaremba, editor, Applications of Number Theory to Numerical Analysis, pages 249-285. Academic Press, New York, 1972.

35

P. L'Ecuyer. Efficient and portable combined random number generators. Comm. of the ACM, 31:742-774, 1988.

36

G. Marsaglia. Diehard. ftp://stat.fsu.edu/pub/diehard.

37

P. Coddington. Tests of random number generators using Ising model simulations. Int. J. of Mod. Phys. ``C'', 7(3):295-303, 1996.

38

E. Hlwaka. Funktionen von beschränkter variation in der theorie der gleichverteiling. Ann. Mat. Pura Appl., 54:325-333, 1961.

39

K. F. Roth. On irregularities of distribution. Mathematika, 1:73-79, 1954.

40

J. H. Halton. On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals. Numer. Math., 2:84-90, 1960.

41

H. Faure. Using permutations to reduce discrepancy. J. Comp. Appl. Math., 31:97-103, 1990.

42

B. L. Fox P. Bratley and H. Niederreiter. Implementation and tests of low-discrepancy point sets. ACM Trans. on Modeling and Comp. Simul., 2:195-213, 1992.

43

W. J. Morokoff and R. E. Caflisch. Quasi-Monte Carlo integration. J. Comp. Phys., 122:218-230, 1995.

The National Center for Supercomputing Applications
University of Illinois at Urbana-Champaign

ashoks@ncsa.uiuc.edu

Last modified: September 16, 1997