The behavior of pseudo-random sequences generated on computers by the multiplicative congruential method
HTML articles powered by AMS MathViewer
- by V. D. Barnett PDF
- Math. Comp. 16 (1962), 63-69 Request permission
References
- Olga Taussky and John Todd, Generation and testing of pseudo-random numbers, Symposium on Monte Carlo methods, University of Florida, 1954, John Wiley and Sons, Inc., New York; Chapman and Hall, Ltd., London, 1956, pp. 15–28. MR 0080382
- K. D. Tocher, The application of automatic computers to sampling experiments, J. Roy. Statist. Soc. Ser. B 16 (1954), 39–61; discussion 61–75. MR 64476
- E. S. Page, Pseudo-random elements for computers, Appl. Statist. 8 (1959), 124–131. MR 107956, DOI 10.2307/2985548
- P. H. Leslie and J. C. Gower, The properties of a stochastic model for two competing species, Biometrika 45 (1958), 316–330. MR 102448, DOI 10.1093/biomet/45.3-4.316
- J. Certaine, On sequences of pseudo-random numbers of maximal length, J. Assoc. Comput. Mach. 5 (1958), 353–356. MR 127511, DOI 10.1145/320941.320949 W. Ledermann, The Theory of Finite Groups, Oliver & Boyd, London, 1949.
Additional Information
- © Copyright 1962 American Mathematical Society
- Journal: Math. Comp. 16 (1962), 63-69
- MSC: Primary 62.99
- DOI: https://doi.org/10.1090/S0025-5718-1962-0136046-5
- MathSciNet review: 0136046