Random Number Generators

Previous article Next article Random Number GeneratorsT. E. Hull and A. R. DobellT. E. Hull and A. R. Dobellhttps: //doi. org/10. 1137/1004061PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout1 V. D. Barnett, The behavior of pseudo-random sequences generated on computers by the multiplicative congruential method, Math. Comp. , 16 (1962), 63–69 MR0136046 (24: B2085) 0108. 13701 N. P. Buslenko and, Ju. A. Sreider, The Monte-Carlo method and how it is carried out on digital computers, Gosudarsty. Izdat. Fiz-Mat. Lit. , Moscow, 1961, (Russian) CrossrefGoogle Scholar2 J. Bass and, J. Guilloud, Méthode de Monte-Carlo et suites uniformément denses, Chiffres, 1 (1958), 149–155 MR0100338 (20: 6771) 0089. 11502 G. Miller Clark, Corrections to 86, Math. Comp. , 16 (1962), 261– CrossrefGoogle Scholar3 N. W. Bazley and, P. J. Davis, Accuracy of Monte Carlo methods in computing finite Markov chains, J. Res. Nat. Bur. Standards Sect. B, 64B (1960), 211–215 MR0129107 (23: B2144) 0102. 12105 Joel N. Franklin, Deterministic simulation of random processes, Technical Report, 118, Computing Center, California Institute of Technology, 1962 CrossrefGoogle Scholar4 W. F. Bauer, The Monte Carlo method, J. Soc. Indust. Appl. Math. , 6 (1958), 438–451 10. 1137/0106028 MR0098455 (20: 4913) 0084. 34601 Masatugu Isida and, Hiroji Ikeda, Random number generator, Ann. Inst. Statist. Math. , Tokyo, 8 (1956), 119–126 MR0086369 (19, 174c) 0075. 28903 LinkISIGoogle Scholar5 Eve, Bofinger and, V. J. Bofinger, On a periodic property of pseudo-random sequences, J. Assoc. Comput. Mach. , 5 (1958), 261–265 MR0131949 (24: A1796) 0091. 14503 R. K. Pathria, A statistical study of randomness among the first 10, 000 digits of, Math. Comp. , 16 (1962), 188–197 MR0144443 (26: 1988) 0106. 13402 CrossrefISIGoogle Scholar6 Eve Bofinger and, V. J. Bofinger, The gap test for random sequences, Ann. Math. Statist. , 32 (1961), 524–534 MR0126909 (23: A4203) 0109. 37302 CrossrefISIGoogle Scholar7 Eve Bofinger and, V. J. Bofinger, A note on the paper by W. E. Thomson on "ERNIE—a mathematical and statistical analysis", J. Roy. Stat. Soc. , A124 (1961), 240–243 CrossrefGoogle Scholar8 G. E. P. Box and, Muller E. Mervin, A Note on the generation of random normal deviates, Annals Math. Stat. , 29 (1958), 610–611 0085. 13720 CrossrefISIGoogle Scholar9 George W. Brown, History of RAND's random digits—summary, Monte Carlo Method, Appl. Math. Series 12, Nat. Bur. Stand. , 1951, 31–32 Google Scholar10 J. C. Butcher, A partition test for pseudo-random numbers, Math. Comp. , 15 (1961), 198–199 MR0130089 (23: B3121) 0111. 14702 CrossrefGoogle Scholar11 J. C. Butcher, Random sampling from the normal distribution, Comput. J. , 3 (1960/1961), 251–253 10. 1093/comjnl/3. 4. 251 MR0127512 (23: B558) 0094. 13503 CrossrefISIGoogle Scholar12 James W. Butler, Herbert A. Meyer, Machine sampling from given probability distributions, Symposium on Monte Carlo methods, University of Florida, 1954, John Wiley and Sons, Inc. , New York, 1956, 249–264 MR0079823 (18, 152b) Google Scholar13 J. M. Cameron, Monte Carlo experiments on SEAC, Working Paper SEL-52-5, Nat. Bur. Stand. , 1951, (Oct. 27) Google Scholar14 J. M. Cameron, Results of some tests of randomness on pseudo-random numbers (preliminary report), Annals Math. Stat. , 23 (1952), 138–, Abstract ISIGoogle Scholar15 E. D. Cashwell and, C. J. Everett, A practical manual on the Monte Carlo method for random walk problems. , International Tracts in Computer Science and Technology and their Application, Vol. 1, Pergamon Press, New York, 1959ix+153 MR0106538 (21: 5269) Google Scholar16 J. Certaine, On sequences of pseudo-random numbers of maximal length, J. Assoc. Comput. Mach. , 5 (1958), 353–356 MR0127511 (23: B557) 0091. 14504 CrossrefISIGoogle Scholar17 Charles E. Clark, The utility of statistics of random numbers, Operations Res. , 8 (1960), 185–195 MR0115262 (22: 6064) 0090. 11102 CrossrefISIGoogle Scholar18 Charles E. Clark and, Betty Weber Holz, Exponentially distributed random numbers, Published for Operations Research Office, The Johns Hopkins University by The Johns Hopkins Press, Baltimore, Md. , 1960vii+249 MR0115263 (22: 6065) 0101. 11703 Google Scholar19 R. R. Coveyou, Serial correlation in the generation of pseudo-random numbers, J. Assoc. Comput. Mach. , 7 (1960), 72–74 MR0117869 (22: 8643) 0096. 33903 CrossrefISIGoogle Scholar20 J. H. Curtiss, "Monte Carlo" methods for the iteration of linear operators, J. Math. Physics, 32 (1954), 209–232 MR0059622 (15, 560b) 0055. 11301 CrossrefISIGoogle Scholar21 P. Davis and, P. Rabinowitz, Some Monte Carlo experiments in computing multiple integrals, Math. Tables Aids Comput. , 10 (1956), 1–8 MR0076451 (17, 901c) 0072. 14403 CrossrefGoogle Scholar22 Edward L. Dodd, Certain tests for randomness applied to data grouped into small sets, Econometrica, 10 (1942), 249–257 MR0007239 (4, 108a) 0063. 01126 CrossrefGoogle Scholar23 H. J. A. Duparc, , C. G. Lekkerkerker and, W. Peremans, Reduced sequences of integers and pseudo-random numbers, Rapport ZW 1953-002, Math. Centrum Amsterdam. , 1953, 15– MR0053417 (14, 770h) 0051. 27403 Google Scholar24 A. R. Edmonds, The generation of pseudo-random numbers on electronic digital computers, Comput. J. , 2 (1959/1960), 181–185 10. 1093/comjnl/2. 4. 181 MR0112271 (22: 3125) 0091. 29702 CrossrefISIGoogle Scholar25 Louis W. Ehrlich, Monte Carlo solutions of boundary value problems involving the difference analogue of 2u/ x2 + 2u/ y2+Ky-1 u/ y=0, J. Assoc. Comput. Mach. , 6 (1959), 204–218 MR0102163 (21: 957) 0085. 33503 CrossrefISIGoogle Scholar26 Carl C. Farrington, Jr. , Generating pseudo-random numbers in the Illiac, Digital Computer Laboratory Report, 74, University of Illinois, 1956 Google Scholar27 E. C. Fieller, , T. Lewis and, E. S. Pearson, Correlated random normal deviates. 3, 000 sets of deviates, each giving 9 random pairs with correlations 0. 1 (0. 1) 0. 9, compiled from Herman Wold's Table of Tandom Normal Deviates (Tract no. XXV), Cambridge, at the University Press, 1955xv+60, Tracts for Computers, no. 26 MR0074728 (17, 638e) 0065. 11802 Google Scholar28 H. Fisser, Some tests applied to pseudo-random numbers generated by v. Hoerner's rule, Numer. Math. , 3 (1961), 247–249 10. 1007/BF01386024 MR0130088 (23: B3120) 0101. 10601 CrossrefGoogle Scholar29 G. E. Forsythe, Generation and testing of 1, 217, 370 "random" binary digits on the SWAG, Bull. Am. Math. Soc. , 57 (1951), 304–, Abstract ISIGoogle Scholar30 George E. Forsythe, Generation and testing of random digits at the National Bureau of Standards, Los Angeles, Monte Carlo Method, Appl. Math. Series 12, Nat. Bur. Stand. , 1951, 34–35 Google Scholar31 J. N. Franklin, On the equidistribution of pseudo-random numbers, Quart. Appl. Math. , 16 (1958), 183–188 MR0093501 (20: 25) 0085. 12802 CrossrefGoogle Scholar32 Robert Gage, Contents of Tippett's "Random Sampling Numbers", J. Amer. Statist. Assoc. , 38 (1943), 223–227 MR0007969 (4, 223b) 0060. 29714 Google Scholar33 E. N. Gilbert, Quasi-random binary sequences, Bell Telephone Laboratory, 1953, (Nov. 27) Google Scholar34 E. N. Gilbert, Machine Computation of random numbers, MM-56-114-3, Bell Telephone Laboratory, 1956, (March 12) Google Scholar35 D. I. Golenko, Formation of random numbers with arbitrary law of distribution, Computational Math. , (1959), 83–92, in Russian Google Scholar36 D. I. Golenko, Determination of characteristics of some stochastic processes by Monte Caro methods, Computational Math. , (1959), 93–108, in Russian Google Scholar37 D. I. Golenko and, V. P. Smiriagin, A source of random numbers which are equidistributed in 0, 1, Publications Math. Inst. , Hungarian Acad. Sci. 5, Series A, Fasc. , 3 (1960), 241–253, in Russian, with English abstract 0096. 11602 Google Scholar38 I. J. Good, The serial test for sampling numbers and other tests for randomness, Proc. Cambridge Philos. Soc. , 49 (1953), 276–284 MR0060786 (15, 727c) 0051. 36203 CrossrefISIGoogle Scholar39 I. J. Good, On the serial test for random sequences, Ann. Math. Statist. , 28 (1957), 262–264 MR0085667 (19, 73h) 0083. 14801 CrossrefISIGoogle Scholar40 Bert F. Green, Jr. , , J. E. Keith Smith and, Laura Klem, Empirical tests of an additive random number generator, J. Assoc. Comput. Mach. , 6 (1959), 527–537 MR0107957 (21: 6678) 0096. 33901 CrossrefISIGoogle Scholar41 Martin Greenberger, Notes on a new pseudo-random number generator, J. Assoc. Comp. Mach. , 8 (1961), 163–167 0104. 36005 CrossrefGoogle Scholar42 Martin Greenberger, An a priori determination of serial correlation in computer generated random numbers, Math. Comp. , 15 (1961), 383–389, See also corrigenda, Math. Comp. 16 (1962), p. 126 MR0144489 (26: 2033) 0113. 33504 CrossrefGoogle Scholar43 Robert E. Greenwood, Coupon collector's test for random digits, Math. Tables Aids Comput. , 9 (1955), 1–5, 224, 229. MR0068168 (16, 840k) 0064. 13906 CrossrefGoogle Scholar44 O. Gross and, S. M. Johnson, Additive generation of pseudorandom numbers, Memorandum, 2132, RAND Corporation Research, 1958 Google Scholar45 Fred Gruenberger, Tests of random digits, Math. Tables Other Aids Comp. , 4 (1950), 244–245 Google Scholar46 Fred Gruenberger and, A. M. Mark, The d^2 test of random digits, Math. Tables Other Aids Comp. , 5 (1951), 109–110 Google Scholar47 J. H. Halton, On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals, Numer. Math. , 2 (1960), 84–90 10. 1007/BF01386213 MR0121961 (22: 12688) 0090. 34505 CrossrefGoogle Scholar48 H. C. Hamaker, A simple technique for producing random sampling numbers, Nederl. Akad. Wetensch. , Proc. , 52 (1949), 145–150 MR0032154 (11, 260a) Google Scholar49 Preston C. Hammer, The mid-square method of generating digits, Monte Carlo Method, Appl. Math. Series 12, Nat. Bur. Stand. , 1951, 33– Google Scholar50 J. M. Hammersley, Monte Carlo methods for solving multivariable problems, Ann. New York Acad. Sci. , 86 (1960), 844–874 (1960) MR0117870 (22: 8644) 0111. 12405 ISIGoogle Scholar51 R. W. Hamming, Numerical methods for scientists and engineers, International Series in Pure and Applied Mathematics, McGraw-Hill Book Co. , Inc. , New York, 1962xvii+411 MR0137279 (25: 735) 0952. 65500 Google Scholar52 H. Burke Horton, A method for obtaining random numbers, Ann. Math. Statistics, 19 (1948), 81–85 MR0024085 (9, 450h) 0031. 37301 CrossrefISIGoogle Scholar53 H. Burke Horton and, III. , R. Tynes Smith, A direct method for producing random digits in any number system, Ann. Math. Statistics. , 20 (1949), 82–90 MR0029117 (10, 550f) 0041. 26505 CrossrefISIGoogle Scholar54 A. S. Householder, Monte Carlo method, Appl. Math. Series 12, Nat. Bur. Stand. , 1951, (editor, with G. E. Forsythe and H. H. Germond) Google Scholar55 D. G. N. Hunter, Note on a test for repeating cycles in a pseudo-random number generator, Comput. J. , 3 (1960/1961), 9– 10. 1093/comjnl/3. 1. 9 MR0111118 (22: 1982) 0087. 32706 CrossrefGoogle Scholar56 Random number generation and testing, New York, 1959 Google Scholar57 D. L. Johnson, Generating and testing pseudo random numbers on the IBM Type 701, Math. Tables Aids Comput. , 10 (1956), 8–13 MR0076467 (17, 902k) 0072. 35705 CrossrefGoogle Scholar58 M. L. Juncosa, Random number generation on the BRL high-speed computing machines, Rep. No. 855, Ballistic Research Laboratories, Aberdeen Proving Ground, Md. , 1953, 25– MR0059617 (15, 559c) Google Scholar59 Herman Kahn, Applications of Monte Carlo, Memorandum, 1237, RAND Corporation Research, 1956, Also appeared as AECU 3259 Google Scholar60 Herman Kahn, Herbert A. Meyer, Use of different Monte Carlo sampling techniques, Symposium on Monte Carlo methods, University of Florida, 1954, John Wiley and Sons, Inc. , New York, 1956, 146–190 MR0079819 (18, 151c) Google Scholar61 M. G. Kendall and, B. Babington-Smith, Randomness and random sampling numbers, J. Roy. Stat. Soc. , 101 (1938), 147–166 CrossrefGoogle Scholar62 M. G. Kendall and, B. Babington-Smith, Second paper on random sampling numbers, J. Roy. Stat. Soc. , 6 (1939), 51–61, Supplement CrossrefGoogle Scholar63 M. G. Kendall and, B. Babington-Smith, Tables of random sampling numbers, Tracts for Computers, no. 24, Cambridge, 1939 0024. 42902 Google Scholar64 W. O. Kermack and, A. G. McKendrick, Tests for randomness in a series of numerical observations, Proc. Roy. Soc. Edinburgh, 57 (1937), 228–240 0016. 41301 CrossrefGoogle Scholar65 W. O. Kermack and, A. G. McKendrick, Some distributions associated with a randomly arranged set of numbers, Proc. Roy. Soc. Edinburgh, 57 (1937), 332–376 0017. 27205 CrossrefGoogle Scholar66 Heidi G. Kuehn, A 48-bit pseudo-random number generator, Comm. ACM, 4 (1961), 350–352 10. 1145/366678. 366690 MR0144490 (26: 2034) 0097. 34001 CrossrefISIGoogle Scholar67 D. H. Lehmer, Mathematical methods in large-scale computing units, Proceedings of a Second Symposium on Large-Scale Digital Calculating Machinery, 1949, Harvard University Press, Cambridge, Mass. , 1951, 141–146 MR0044899 (13, 495f) 0045. 40001 Google Scholar68 D. H. Lehmer, Combinatorial problems with digital computers, Proc. Fourth Can. Math. Congress, 1957, 160–173 0103. 35303 Google Scholar69 P. H. Leslie and, J. C. Gower, The properties of a stochastic model for two competing species, Biometrika, 45 (1958), 316–330 MR0102448 (21: 1241) 0087. 34501 CrossrefISIGoogle Scholar70 H. Levene and, J. Wolfowitz, The covariance matrix of runs up and down, Ann. Math. Statistics, 15 (1944), 58–69 MR0009823 (5, 208e) 0063. 03502 CrossrefGoogle Scholar71 Werner Liniger, On a method by D. H. Lehmer for the generation of pseudo random numbers, Numer. Math. , 3 (1961), 265–270 10. 1007/BF01386027 MR0129529 (23: B2565) 0100. 33702 CrossrefGoogle Scholar72 Ernest J. Lytle, Jr. , Herbert A. Meyer, A description of the generation and testing of a set of random normal deviates, Symposium on Monte Carlo methods, University of Florida, 1954, John Wiley and Sons, Inc. , New York, 1956, 234–248 MR0080381 (18, 239a) Google Scholar73 P. C. Mahalanobis, Tables of random samples from a normal population, Sankyha, 1 (1934), 289–328 Google Scholar74 S. E. Mamangakis, Remarks on the Fibonacci series modulo m, Amer. Math. Monthly, 68 (1961), 648–649 MR0130206 (24: A73) 0101. 03202 CrossrefISIGoogle Scholar75 G. Marsaglia, Expressing a random variable in terms of uniform random variables, Ann. Math. Statist. , 32 (1961), 894–898 MR0130090 (23: B3122) 0139. 35604 CrossrefGoogle Scholar76 G. Marsaglia, Generating exponential random variables, Ann. Math. Statist. , 32 (1961), 899–900 MR0130091 (23: B3123) 0139. 35603 CrossrefGoogle Scholar77 G. Marsaglia, Remark on generating a random variable having a nearly linear density function, Mathematical Note no. 242, Boeing Scientific Research Laboratories, Seattle, 1961 Google Scholar78 G. Marsaglia, Procedures for generating normal random variables, II, Mathematical Note no. 243, Boeing Scientific Research Laboratories, Seattle, 1961 CrossrefGoogle Scholar79 Andrew W. Marshall, Herbert A. Meyer, The use of multistage sampling schemes in Monte Carlo computations, Symposium on Monte Carlo methods, University of Florida, 1954, John Wiley and Sons, Inc. , New York, 1956, 123–140 MR0079827 (18, 153b) Google Scholar80 A. De Matteis and, B. Faleschini, Pseudo-random sequences of equal length, Report, 88, Comitato Nazionale per l'Energia Nucleare, Bologna, 1960 Google Scholar81 J. W. Mauchly, Pseudo-random numbers, Report, Eckert-Mauchly Computer Corporation, 1949 Google Scholar82 N. Metropolis, Herbert A. Meyer, Phase shifts-middle squares-wave equations, Symposium on Monte Carlo methods, University of Florida, 1954, John Wiley and Sons, Inc. , New York, 1956, 29–36 MR0088787 (19, 580c) Google Scholar83 Herbert A. Meyer, Symposium on Monte Carlo methods, Wiley, New York, 1956 0070. 13402 Google Scholar84 H. A. Meyer, , L. S. Gephart and, N. L. Rasmussen, On the generation and testing of random digits, WADC Tech. Rep. , 54-55, Air Res. Dev. Command, Wright-Patterson Air Force Base, 1954 Google Scholar85 Jack Moshman, The generation of pseudo-random numbers on a decimal calculator, J. Assoc. Computing Mach. , 1 (1954), 88–91 MR0061882 (15, 900c) CrossrefISIGoogle Scholar86 Mervin E. Muller, An inverse method for the generation of random normal deviates on large-scale computers, Math. Tables Aids Comput. , 12 (1958), 167–174 MR0102905 (21: 1690) 0082. 33602 CrossrefGoogle Scholar87 Mervin E. Muller, A comparison of methods for generating normal deviates on digital computers, J. Assoc. Comput. Mach. , 6 (1959), 376–383 MR0105785 (21: 4521) 0086. 11601 CrossrefISIGoogle Scholar88 Mervin E. Muller, A note on a method for generating points uniformly on N-dimensional spheres, Comm. Assoc. Comp. Mach. 2, (1959), 19–20 0086. 11605 Google Scholar89 K. N. Nair, On Tippett's random sampling numbers, Sankhya, 4 (1938), 65–72 Google Scholar90 Gösta Neovius, Artificial traffic trials using digital computers, Ericsson Technics, 11 (1955), 279–291 MR0074136 (17, 542e) Google Scholar91 Guy H. Orcutt, , Martin Greenberger, , John Korbel and, Alice M. Rivlin, Microanalysis of socioeconomic systems: a simulation study, Harper, New York, 1961 Google Scholar92 Oystein Ore, Number Theory and Its History, McGraw-Hill Book Company, Inc. , New York, 1948x+370 MR0026059 (10, 100b) 0041. 36805 Google Scholar93 E. S. Page, The Monte Carlo solution of some integral equations, Proc. Cambridge Philos. Soc. , 50 (1954), 414–425 MR0064496 (16, 291d) 0055. 35805 CrossrefISIGoogle Scholar94 E. S. Page, Pseudo-random elements for computers, Appl. Statist. , 8 (1959), 124–131 MR0107956 (21: 6677) CrossrefISIGoogle Scholar95 G. K. Pakov, Generation of a random correlated quantity on a high-speed electronic computer, Soviet Develop. Infor. Proc. Machine Translat. , U. S. Joint Publ. Res. Service JPRS: 5784, 1960, Nov. Google Scholar96 Z. Pawlak, Flip-flop as generator of random binary digits, Math. Tables Aids Comput. , 10 (1956), 28–30 MR0076466 (17, 902j) Google Scholar97 Paul Peach, Bias in pseudo-random numbers, J. Amer. Statist. Assoc. , 56 (1961), 610–618 MR0134452 (24: B505) 0111. 14801 CrossrefISIGoogle Scholar98 L. G. Peck, On uniform distribution of algebraic numbers, Proc. Amer. Math. Soc. , 4 (1953), 440–443 MR0055385 (14, 1066e) 0050. 27601 CrossrefISIGoogle Scholar99 Anthony Ralston and, Herbert S. Wilf, Mathematical methods for digital computers, John Wiley & Sons Inc. , New York, 1960xi+293 MR0117906 (22: 8680) 0089. 12602 Google Scholar100 Band Corporation, A million random digits with 100, 000 normal deviates, The Free Press, Glencoe, Ill. , 1955xxv+200 MR0067568 (16, 749i) 0068. 12905 Google Scholar101 C. Radhakrishna Rao, Generation of random permutations of given number of elements using random sampling numbers, Sankhya, A23 (1961), 305–307 0104. 12103 Google Scholar102 R. D. Richtmyer, The evaluation of definite integrals, and a Quasi-Monte-Carlo method based on the properties of algebraic numbers, LA-1342, Los Alamos Scientific Laboratory, 1951 Google Scholar103 R. D. Richtmyer, A non-random sampling method, based on congruences, for "Monte Caro" problems, Report Physics, NYO-8674, Institute Math. Sci. , NYU, 1958 Google Scholar104 R. D. Richtmyer, Monte Carlo methodsProc. Sympos. Appl. Math. , Vol. XI, American Mathematical Society, Providence, R. I. , 1961, 190–205, Nuclear Reactor Theory MR0119381 (22: 10145) CrossrefGoogle Scholar105 R. D. Richtmyer, , Marjorie Devaney and, N. Metropolis, Continued fraction expansions of algebraic numbers, Numer. Math. , 4 (1962), 68–84 10. 1007/BF01386297 MR0136574 (25: 44) 0101. 28101 CrossrefGoogle Scholar106 A. C. Rosander, The use of inversions as a tsst of random order, J. Amer. Stat. Assoc. , 37 (1942), 352–358 CrossrefGoogle Scholar107 A. Rotenberg, A new pseudo-random number generator, J. Assoc. Comput. Mach. , 7 (1960), 75–77 MR0117868 (22: 8642) CrossrefISIGoogle Scholar108 Lorraine Schwartz, Review of 73, Math. Tables Other Aids Comp. , 8 (1954), 228– CrossrefGoogle Scholar109 J. M. Sengupta and, Nikhilesh Bhattacharya, Tables of random normal deviates, Sankhya, 20 (1958), 249–286 MR0106553 (21: 5284) 0228. 65003 Google Scholar110 Daniel Shanks and, John W. Wrench, Jr. , Calculation of to 100, 000 decimals, Math. Comp. , 16 (1962), 76–99 MR0136051 (24: B2090) 0104. 36002 Google Scholar111 I. M. Pseudo-random numbers for the Theory 3 (1958), Google J. A to Monte Carlo methods and an to a of 4 (1962), LinkISIGoogle Random numbers and their and 4 (1955), 23 Google Fred Random number generator using Sci. (1959), CrossrefISIGoogle The of a Biometrika, 6 CrossrefGoogle S. and, C. Tables for testing randomness of in a of Ann. Math. Statistics, (1943), CrossrefGoogle and, John Herbert A. Meyer, Generation and testing of pseudo-random numbers, Symposium on Monte Carlo methods, University of Florida, 1954, John Wiley and Sons, Inc. , New York, 1956, Google D. sampling with computers, of Google W. E. A method of generating pseudo-random numbers, Comp. J. , 1 (1958), CrossrefISIGoogle W. E. mathematical and statistical J. Roy. Stat. Soc. , (1959), CrossrefGoogle L. H. C. On the and the of samples from a normal population, Biometrika, CrossrefGoogle L. H. C. Random sampling numbers, Tracts for Computers, no. Cambridge, Google K. D. The of computers to sampling J. Roy. Statist. Soc. 16 (1954), Google John in the solution of by Monte Carlo methods, J. Acad. Sci. , (1954), Google John of numerical McGraw-Hill Book Co. , Inc. , New York, Google C. B. Review of Math. Tables Other Aids Comp. , 10 (1956), Google C. B. Review of Standards random number generating Math. Comp. , 15 (1961), CrossrefGoogle C. Machine on problems are Proceedings of in Applied Vol. Numerical Published by McGraw-Hill Book Company, Inc. , New York, for the American Mathematical Society, Providence, R. I. , 1956, Numerical Google A. and Digital Proc. National Laboratory, 1954, Google C. W. On a random from a set of J. Roy. Stat. Soc. , 6 (1939), Supplement Google Z. Math. 8 (1957), CrossrefGoogle John in with random digits, Monte Carlo Method, Appl. Math. Series 12, Nat. Bur. Stand. , 1951, Google D. F. and, J. A. Math. Tables and Other Aids to 5 (1951), 1–8 CrossrefGoogle D. D. Fibonacci series modulo m, Amer. Math. Monthly, (1960), CrossrefGoogle D. A random number test for Proc. IBM Stat. , 1960, Google John E. in the binary system, Ann. Math. Statistics, 20 (1949), CrossrefISIGoogle John E. An method for obtaining random digits and Sankhya, (1957), Google James G. on Monte Carlo, on Numerical of 1961 Google Math. CrossrefGoogle Herman Random Normal from No. G. Kendall and B. Tables of Random Sampling Cambridge University Press, Tracts for Computers, no. Google G. A test of Tippett's random sampling numbers, J. Roy. Stat. Soc. , 101 (1938), CrossrefGoogle sequences, J. Soc. Indust. Appl. Math. , 7 (1959), LinkISIGoogle Previous article Next article for Random Number International Symposium on Computer 1 A and to pseudo-random number and for Vol. No. 1 probability density distribution of with International on Random Number Generation in International Symposium on Computer 1 based on and in Vol. 1 Generation of Random Computing 11 of and Vol. No. 5 7 in and Computational Vol. No. 1 11 Number Vol. No. 1 6 in in 1 for Computation and 1 Generating Random by A Science 15 The of for in 1 a for of and Vol. 1 and Computational for A for in of Vol. No. 4 1 of The in a Vol. No. 9 12 for International on and 1 International on 1 for of 4 A of of the International on of 1 Monte Carlo to out an in a Number of of Applied and Mathematics, Vol. No. 4 1 and and 2 in the probability Vol. 1 Random number Review Vol. No. 6 28 in