Blum, M., Micali, S. (1984). How to generate cryptographically strong sequences of pseudorandom bits. S.I.A.M. J. Computing, 13, 850-864.

Devroye, L. (1984). The use of probability inequalities in random variate generation. J. Stat. Comp. Simul., 20, 91-100.

Rasmussen, J. L. (1984). A Fortran program for statistical evaluation of pseudorandom number generators. Behavior Research Methods and Instrumentation, 16, 63-64.

Scholtz, R. A. (1984). GMW sequences. I.E.E.E. Trans. Oil Information Theory, IT-30, 548-552.

Barel, M. (1983). Fast hardware random number generator for the Tausworthe sequence. Proc. 16th Annual Simulation Symposium, Florida (121-135).

Barel, M., Jobes, B. (1983). Testing of uniform random number generators. (In German). Angewandte Informatik, 25, 404-409.

Borosh, I., Niederreiter, H. (1983). Optimal multipliers for pseudorandom number generation by the linear congruential method. BIT, 23, 65-74.

Erber, T., et al. (1983). The simulation of random processes on digital computers: unavoidable order. J. Computational Physics, 49, 394-419.

Fushimi, M. (1983). Increasing the orders of equidistribution of the leading bits of the Tausworthe sequence. Information Processing Letters, 16, 189-192.

Fushimi, M. (1983). A reciprocity theorem on the random number generation base on Msequences and its applications. (In Japanese). Trans. Inform. Proc. Society of Japan, 24, 576-579.

Fushimi, M., Tezuka, S. (1983). The k-distribution of generalized feedback shift register pseudorandom numbers. C.A.C.M., 26, 516-523.

Hopkins, T. R. (1983). Algorithm AS 193: a revised algorithm for the spectral test. Applied Statistics, 32, 328-335.

Jennergren, L. P. (1983). Another method for random number generation on microcomputers. Simulation, 41, 79.

Marse, K., Roberts, S. D. (1983). Implementing a portable Fortran uniform (0, 1) generator. Simulation., 41, 135-139.

Miyatake, O., et al. (1983). Mathematical analysis of random number generator using gamma rays, part I. Mathematica Japonica, 28, 399-414.

Pearson, R. B. (1983). An algorithm for pseudorandom number generation suitable for large scale integration. J. Computational Physics, 49, 478-489.

Ripley, B. D. (1983). The lattice structure of pseudorandom number generators. Proc. Royal Society London (A) (197-204).

Rosenbaum, W., Syrotuik, J., Gordon, R. (1983). Random number generators for microcomputers. Computer Programs in Biomedicine, 16, 235-240.

Savir, J. (1983). A new empirical test for the quality of random integer generators. I.E.E.E. Trans. on Computers, C32, 960-961.

Van Es, A. J., Gill, R. D., Van Putten, C. (1983). Random number generators for a pocket calculator. Statistica Neerlandica, 37, 95-102.

Bartels, R. (1982). The rank version of von Neumann's ratio test for randomness. J.A.S.A., 77, 40-46.

Crigler, J. R. (1982). RANDOM: a computer program for evaluating pseudo-uniform random number generators. U.S. Government Report AD-A 118412/6.

Deans, N. D., Mann, D. P. (1982). An improved generation technique for random number sequences. Mathematics and Computers in Simulation, 24, 314-325.

Devroye, L. (1982). A note on approximations in random variate generation. J. Stat. Comp. Simul., 14, 149-158.

Fishman, G. S., Moore, L. R. (1982). Statistical evaluation of multiplicative congruential random number generators with modulus 231-1. J.A.S.A., 77, 129-136.

Niederreiter, H. (1982). Statistical tests for Tausworthe pseudorandom numbers. Reidel.

Rizzi, A. (1982). The generation of pseudorandom binary digits by primitive polynomes. (In Italian). Statistica, 42, 193-207.

Roberts, C. S. (1982). Implementing and testing new versions of a good 48-bit pseudorandom number generator. Bell System Tech. J., 61, 2053-2063.

Battaglia, F. (1981). Reproduction of autocorrelations in the generation of pseudorandom normal numbers. (In Italian) Metron, 39(3), 187-208.

Dudewicz, E. J., Ralley, T. G. (1981). The Handbook of Random Number Generation and Testing with TESTRAND Computer Code. American Sciences Press.

Fishman, G. S., Moore, L. R. (1981). In search of correlation in multiplicative congruential generators with modulus 2^31. Proc. 13th Symposium on the Interface of Computer Science and Statistics (ed. W.F. Eddy) (155-157). Springer.

Gentle, J. E. (1981). Probability considerations for random number generators. Proc. 13th Symposium on the Interface of Computer Science and Statistics (ed. W.F. Eddy) (158-164). Springer.

Grafton, R. G. T. (1981). Algorithm AS 157: the runs-up and runs-down tests. Applied Statistics, 30, 81-85.

Kaplan, H. L. (1981). Effective random seeding of random number generators. Behavior Research Methods and Instrumentation, 13, 283-289.

Kirkpatrick, S., Stoll, E. P. (1981). A very fast shift-register sequence random number generator. J. Computational Physics, 40, 517-526.

Nekrutkin, V. V. (1981). Justification of the selection method for a multiplicative pseudorandom number generator. U.S.S.R. Computational Mathematics and Mathematical Physics, 21(5), 25-33.

Atkinson, A. C. (1980). Tests for pseudorandom numbers. Applied Statistics, 29, 164-171.

Bentley, J. L., Saxe, J. B. (1980). Generating sorted lists of random numbers. A.C.M. Traps. on Mathematical Software, 6, 359-364.

O'Brien, G. L. (1980). Pairwise independent random variables. Ann. Prob., 8, 170-175.

Peskun, P. H. (1980). Theoretical tests for choosing the parameters of the general mixed linear congruential pseudorandom number generator. J. Stat. Comp. Simul., 11, 281-305.

Ribeiro, C. A. (1980). Method for obtaining small sets of pseudorandom numbers with uniform distribution. Computer Physics Communications, 19, 305-307.

Soulis, A. (1980). Recent developments in linear congruential and other methods for pseudorandom number generation. Ph.D. thesis. Chelsea College, University of London, U.K..

Tsay, H. (1980). Stringent statistical tests for randomness and random number generators. Ph.D. thesis. Washington State University, U.S.A..

Bright, H. S., Enison, R. L. (1979). Quasi-random number sequences from a long period TLP generator with remarks on application to cryptography. Computing Surveys, 11, 357-370.

Brown, M., Solomon, H. (1979). On combining pseudorandom number generators. Ann. Stat., 7, 691-695.

Del Junco, A., Steele, J. M. (1979). Hammersley's law for the van der Corput sequence: an instance of probability theory for pseudorandom numbers. Ann. Prob., 7, 267-275.

Hill, G. W. (1979). Cyclic properties of pseudorandom sequences of Mersenne prime residues. Computer J., 22, 80-85.

Moore, J. L., Thomas, F. H. (1979). A random number generator for BASIC programs. Computer Education, 33, 13-16.

Pangratz, H., Weinrichter, H. (1979). Pseudorandom number generator based on binary and quinary maximallength sequences. I.E.E.E. Trans. on Computers, C-28, 637-642.

Pavlov, A. I., Pokhodzei, B. B. (1979). Pseudorandom numbers generated by linear recurrence relations over a finite field. U.S.S.R. Computational Mathematics and Mathematical Physics vol. 19, no., 19(4), 38-44.

Schrage, L. (1979). A more portable Fortran random number generator. A.C.M. Trans. on Mathematical Software, 5, 132-138.

Tripathi, V. S. (1979). RANTEST - a Fortran IV program for testing randomness of uniform pseudorandom numbers. Computers and Geosciences, 5, 251-268.

Arvillias, A., Maritsas, D. G. (1978). Partitioning the period of a class of m-sequences and application to pseudorandom number generation. J.A.C.M., 25, 675-686.

Galperin, E. A. (1978). Loop properties and controllability of linear congruential sequences. IEEE Trans. on Computers, C-27, 68-76.

Garpman, S., Randrup, J. (1978). Statistical tests for pseudorandom number generators. Computer Physics Communications., 15, 5-13.

Holmlid, L., Rynefors, K. (1978). Uniformity of congruential pseudorandom number generators: dependence on length of number sequence and resolution. J. Computational Physics, 26, 297-306.

Li, T-Y., Yorke, J. A. (1978). Ergodic maps on [0, 1] and non-linear pseudorandom number generators. Nonlinear Analysis: Theory, Afethods and Applications, 2, 473-481.

Maritsas, D. G., Arvillias, A., Bounas, A. C. (1978). Phase-shift analysis of linear feedback shift register structures generating pseudorandom sequences. LEEE Trans. on Computers, C-27, 660-669.

Niederreiter, H. (1978). Statistical tests for linear congruential pseudorandom numbers. Proc. COMPSTAT 1978 (ed. L. Corsten and J. Hermans) (398-404). Physica Verlag.

Niederreiter, H. (1978). The serial test for linear congruential pseudorandom numbers. Bull. Amer. Math. Soc., 84, 273-274.

Niederreiter, H. (1978). Quasi-Monte Carlo methods and pseudorandom numbers. Bull. Amer. Math. Soc., 84, 957-104.

Romankevich, A. M. (1978). A method of construction of nonlinear generators of pseudorandom sequences. Cybernetics, 14, 141-142.

Akchurin, R. M. (1977). A random number generator. Programming and Computer Software, 3, 392-395.

Amadori, R. (1977). Correlation defects in the standard IBM 360 random number generator and the classical ideal gas correlation function. J. Computational Physics, 24, 450-454.

Bohrer, R., Imrey, P. B. (1977). Statistics, stationarity and random number generation. Simuletter, 9, 64-71.

Camp, W. V., Lewis, T. G. (1977). Implementing a pseudorandom number generator on a minicomputer. I.E.E.E. Trans. on Software Engineering, SE-3, 259-262.

Gait, J. (1977). A new nonlinear pseudorandom number generator. I.E.E.E. Trans. on Software Engineering, SE-3, 359-363.

Jackson, D. (1977). Software generation of pseudorandom sequences. Electronic Engineering, 49(December), 55-58.

Kurita, Y. (1977). Choosing parameters for congruential random number generators. North-Holland.

Miller, A. J., Brown, A. W., Mars, P. (1977). A simple technique for the determination of delayed maximal length linear binary sequences. I.E.E.E. Trans. on Computers, C-26, 808-810.

Miller, A. J., Mars, P. (1977). Theory and design of a digital stochastic computer random number generator. Mathematics and Computers in Simulation, 19, 198-216.

Musyck, E. (1977). Search for a perfect generator of random numbers. Working Paper BLG 516, Belgium: Centre d'Etude de I'Energie Nucleaire, Mol.

Niederreiter, H. (1977). Pseudorandom numbers and optimal coefficients. Advances in Mathematics, 26, 99-181.

Peskun, P. (1977). Improving the apparent randomness of pseudorandom numbers generated by the mixed congruential method. Proc. 10th Annual Symposium on the Interface of Computer Science and Statistics (ed. D. Hogben and D. Fife) (323-328).

Reiser, J. F. (1977). Analysis of additive random number generators. U.S. Government Report AD-A045652/5.

Yuen, C. K. (1977). Testing random number generators by the Walsh transform. I.E.E.E. Trans. on Computers. C26, 329-333.

Enison, R. L., Bright, H. S. (1976). Preliminary testing of a 64-bit Tausworthe-Lewis-Payne generator of Mersenne exponent degree. Proc. 9th Symposium on the Interface of Computer Science and Statistics. (208-211).

Greenwood, J. A. (1976). The demands of trivial combinatorial problems on random number generators. Proc. 9th Symposium on the Interface of Computer Science and Statistics (ed. D. Hoaglin and R. Welsch) (222-227).

Knuth, D. E., Yao, A. C. (1976). The complexity of nonuniform random number generation. Academic Press.

Learmonth, G. P. (1976). Empirical tests of multipliers for the prime-modulus random number generator X (I + 1) = AX(I) mod 2^31 - 1. Proc. 9th Symposium on the Interface of Computer Science and Statistics (ed. D. Hoaglin and R. Welsch). (178-183).

Levin, L. A. (1976). Uniform tests of randomness. Soriet Mathematics., 17, 337-340.

McArdle, J. (1976). Empirical tests of multivariate generators. Proc. 9th symposium on the Interface of Computer Science and Statistics (ed. D. Hoaglin and R. Welsch) (263-267).

Niederreiter, H. (1976). Statistical independence of linear congruential pseudorandom numbers. Bull. Amer. Math. Society, 82, 927-929.

Fredericsson, S. A. (1975). Pseudorandom ness properties of binary shift register sequences. I.E.E.E. Trams. on Information Theory, IT-21, 115-120.

Walker, A. J. (1974). Fast generation of uniformly distributed pseudorandom numbers with floating point representation. Electronics Letters, 10, 533-534.

Burford, R. L. (1973). A better additive congruential random number generator. Decision Sciences, 4, 190-193.

Grube, A. (1973). Multiply recursive generation of pseudorandom numbers. (In German). Z. Angew. Math. and Mechanik, 53, T223-T225.

Kirschenmann, P. (1972). Concepts of randomness. J. Philosophical Logic, 1, 395-414.

Beyer, W. A., Roof, R. B., Williamson, D. (1971). The lattice structure of multiplicative congruential pseudorandom vectors. Math. Comp., 25, 345-363.

Dieter, U. (1971). Pseudorandom numbers: An exact distribution of pairs. Math. Comp., 25, 855-883.

Dieter, U., Ahrens, J. (1971). An exact determination of serial correlations of pseudorandom numbers. Numer. Math., 17, 101-123.

Linder, A. (1971). Testing a table of random numbers. Univ. of N. Carolina Press.

Payne, W. H., Lewis, T. G. (1971). Continuous distribution sampling: accuracy and speed. Acadenic Software.

Smith, C. S. (1971). Multiplicative pseudorandom number generators with prime modulus. J.A.C.M., 18, 586-593.

Tootill, J. P., Robinson, W. D., Adams, A. G. (1971). The runs up and down performance of Tausworthe pseudorandom number generators. J.A.C.M., 18, 381-399.

Ahrens, J., Dieter, U., Grube, A. (1970). Pseudorandom numbers: a new proposal for the choice of multiplicators. Computing, 6, 121-138.

Downham, D. Y. (1970). Algorithm AS 29: The runs up and down test. Applied Statistics, 19, 190-192.

Gustavson, F. G., Liniger, W. (1970). A fast random number generator with good statistical properties. Computing, 6, 221-226.

Haber, S. (1970). Sequences of numbers that , are approximately completely equidistributed. J.A.C.M., 17, 269-272.

Marsaglia, G. (1970). Regularities in congruential random number generators. Numer. Math., 16, 8-10.

Payne, W. H. (1970). FORTRAN Tausworthe pseudorandom number generator. C.A.C.M., 13, 57.

Schnorr, C. P. (1970). On the definition of effective random tests. (In German.) Zeitschr. fur Wahrscheinlichkeitstheorie, Part I, 15, pp. 297-312.

Schnorr, C. P. (1970). On the definition of effective random tests. (In German.) Zeitschr. fur Wahrscheinlichkeitstheorie, Part II, 15, pp. 313-328.

Stoneham, R. G. (1970). On a new class of multiplicative pseudorandom number generators. B.I.T., 10, 481-500.

Bell, C. B., Donoghue, J. F. (1969). Distribution-free tests of randomness. Sankhya, A, 31, 157-176.

Coveyou, R. (1969). Random number generation is too important to be left to chance. Studies in Appl. Math., 3, 70-111.

Cunsolo, D. (1969). Generation of pseudorandom numbers with period greater than the base m. (In Italian.) Calcolo, 6, 69-85.

Dieter, U. (1969). Autocorrelation in multiplicatively-generated pseudorandom numbers. (In German.) Op. Res. Verfahren, 6, 69-85.

Downham, D. Y. (1969). The runs up and down test. Computer J., 12, 373-376.

Fellen, B. M. (1969). An implementation of the Tausworthe generator. C.A.C.M., 12, 413.

Hemmerle, W. J. (1969). Generating pseudorandom numbers on a two's complement machine such as the I.B.M. 360 C.A.C.M., 12, 382-383.

Knuth, D. E. (1969). Random Numbers Addison-Weley.

Kruskal, J. B. (1969). Extremely portable random number generator. C.A.C.M., 12, 93-94.

Lewis, P. A., Goodman, A. S., Miller, J. M. (1969). A pseudorandom number generator for the System/360. I.B.M. Systems J., 8, 136-146.

Martin-Lof, P. (1969). Algorithms and randomness. Review of the I.S.I., 37, 265-272.

Payne, W. H., Rabung, J. R., Bogyo, T. P. (1969). Coding the Lehmer pseudorandom number generator. C.A.C.M., 12, 85-86.

Seraphin, D. S. (1969). A fast random number generator for I.B.M. 360. C.A.C.M., 12, 695.

Verdier, P. H. (1969). Relations within sequences of congruential pseudorandom numbers. J. Res. Nat. Bur. Standards, B, 73, 41-44.

Whittlesey, J. R. B. (1969). On the multidimensional uniformity of pseudorandom generators. C.A.C.M., 12, 247.

Bradley, J. V. (1968). Runs tests of randomness. Prentice-Hall.

Forsythe, A. B. (1968). Random number generators. Computers and Biomedical Research, 1, 470-474.

Gardner, M. (1968). On the meaning of randomness and some ways of achieving it. Scientific American, July 1968, 116-121.

Marsaglia, G. (1968). Random numbers fall mainly in the planes. Proc. Nat. Acad. Sci. (25-28).

Marsaglia, G., Bray, T. (1968). One-line random number generators and their use in combinations. C.A.C.M., 11, 757-759.

Miller, J. C. P., Prentice, M. J. (1968). Additive congruential pseudorandom number generators. Computer J., 11, 341-346.

Whittlesey, J. R. B. (1968). A comparison of the correlational behaviour of random number generators for the I.B.M. 360. C.A.C.M., 11, 641-644.

Canavos, G. C. (1967). A comparative analysis of two concepts in the generation of uniform pseudorandom numbers. Proc. 22nd Conf. of the A.C.M. (pp. 485-501).

Coveyou, R. R., MacPherson, R. D. (1967). Fourier analysis of uniform random number generators. J.A.C.M., 14, 100-119.

Downham, D. Y., Roberts, F. D. (1967). Multiplicative congruential pseudorandom number generators. Computer J., 10, 74-77.

Good, I. J., Gover, T. N. (1967). The generalised serial test and the binary expansion of V2. J.R.S.S., A, 130, 102-107.

Gorenstein, S. (1967). Testing a random number generator. C.A.C.M., 10, 111-118.

Hemmerle, W. (1967). Statistical Computations on a Digital Computer. Blaisdell.

Itzelsberger, G. (1967). Some experiences with the poker test for investigating pseudorandom numbers. English Universities Press.

Strome, W. M. (1967). Algorithm 294: uniform random numbers. C.A.C.M., 10, 40.

van Gelder, A. (1967). Some new results in pseudorandom number generation. J.A.C.M., 14, 785-792.

Gorenstein, S. (1966). Another pseudorandom number generator. C.A.C.M., 9, 711.

Hutchinson, D. W. (1966). A new uniform pseudorandom number generator. C.A.C.M., 9, 432-433.

Martin-Lof, P. (1966). The definition of random sequences. Information and Control, 9, 602-619.

Greenberger, M. (1965). Method in randomness. C.A.C.M., 8, 177-179.

Jagerman, D. L. (1965). Some theorems concerning pseudorandom numbers. Math. Comp., 19, 418-426.

Jansson, B. (1965). Analytical studies of pseudorandom number generators of the congruential type. Proc. of the I.F.I.P. Congress. (pp. 371-372).

Knuth, D. E. (1965). Construction of a random sequence. B.I.T., 5, 246-250.

Pike, M. C., Hill, I. D. (1965). Algorithm 266: pseudorandom numbers. C.A.C.M., 8, 605-606.

Reeves, C. M. (1965). Algorithm 8: a uniform random number generator. Computer Bulletin, 9, 105.

Tausworthe, R. C. (1965). Random numbers generated by linear recurrence modulo 2. Math. Comp., 19, 201-209.

Esmenjaud-Bonnardel, M. (1964). A procedure for the generation of pseudorandom numbers on the CAB 500. (In French.) Chiffres, 7, 185-197.

Hammer, C., Green, L. (1964). Generation of Random Numbers. Instruments and Control Systems., 37(5), pp. 149-150.

Hull, T. E., Dobell, A. R. (1964). Mixed congruential random number generators for binary machines. J.A.C.M., 11, 31-40.

Jagerman, D. L. (1964). The autocorrelation and joint distribution functions of the sequences {aj^2/m} and {a(j+t)^2/m}. Math. Comp., 18, 211-232.

Jansson, B. (1964). Generation of random bivariate normal deviates and computation of related integrals. B.I.T., 4, 205-212.

Stockmal, F. (1964). Calculations with pseudorandom numbers. J.A.C.M., 11, 41-52.

Allard, J., Dobell, A. R., Hull, T. E. (1963). Mixed congruential random number generators for decimal machines. J.A.C.M., 10, 131-141.

Franklin, J. N. (1963). Deterministic simulation of random processes. Math. Comp., 17, 28-59.

Jagerman, D. L. (1963). The autocorrelation function of a sequence uniformly distributed modulo 1. Ann. Math. Stat., 34, 1243-1252.

Kolmogorov, A. N. (1963). On tables of random numbers. Sankhya, A, 25, 369-376.

Barnett, V. D. (1962). The behaviour of pseudorandom sequences generated on computers by the multiplicative congruential method. Math. Comp., 16, 63-69.

Behrenz, P. G. (1962). Algorithm 133: a uniform random number generator. C.A.C.M., 5, 553.

Galler, B. (1962). Random number generators. McGraw-Hill.

Hamming, R. W. (1962). Random numbers and Monte Carlo methods. McGraw-Hill.

Walsh, J. E. (1962). Tests of randomness. Van Nostrand.

Bofinger, E., Bofinger, V. J. (1961). The gap test for random sequences. Ann. Math. Stat., 32, 524-534.

Butcher, J. C. (1961). Random sampling from the normal distribution. Computer J., 3, 251-253.

Greenberger, M. (1961). Notes on a new pseudorandom number generator. J.A.C.M., 8, 163-167.

Greenberger, M. (1961). An a priori determination of serial correlation in computer generated random numbers. Math. Comp., 15, 383-389.

Herrmann, R. G. (1961). The Statistical Evaluation of Random Number Generating Sequences for Digital Computers. General Electric Co. report APEX - 635 U.S. Dept. of Commerce, Office of Technical Services.

Kuehn, H. G. (1961). A 48-bit pseudorandom number generator. C.A.C.M., 4, 350-352.

Liniger, W. (1961). On a method by D. H. Lehmer for the generation of pseudorandom numbers. Numer. Math., 3, 265-270.

Mamangakis, S. E. (1961). Remarks on the Fibonacci series modulo m. Amer. Math. Monthly, 68, 648-649.

Peach, P. (1961). Bias in pseudorandom numbers. J.A.S.A., 56, 610-618.

Butcher, J. C. (1960). The simulation of randomness. Proc. First Australian Computer Conf. (pp. 12/1/1-12/1/2).

Coveyou, R. R. (1960). Serial correlation in the generation of pseudorandom numbers. J.A.C.M., 7, 72-74.

Hunter, D. G. (1960). Note on a test for repeating cycles in a pseudorandom number generator. Computer J., 3, 9.

Rotenberg, A. (1960). A new pseudorandom number generator. J.A.C.M., 7, 75-77.

Wall, D. D. (1960). A random number test for large samples. Proc. First I.B.M. Conference on Statistics, Poughkeepsie (pp. 7-11).

Wall, D. D. (1960). Fibonacci series modulo m. Amer. Math. Monthly, 67, 525-532.

Yamada, S. (1960). On the period of pseudorandom numbers generated by Lehmer's congruential method. J. Op. Research Soc. Japan, 3, 113-123.

Green, B. F., Smith, J. E K., Klem, L. (1959). Empirical tests of an additive random number generator. J.A.C.M., 6, 527-537.

I.B.M. Corp. (1959). Random Number Generation and Testing. Form C20-8011, New York:.

Popper, K. (1959). The Logic of Scientific Discovery. (Appendix (iv) and (*vi).) Hutchinson.

Zierler, N. (1959). Linear recurring sequences. J. of S.I.A.M., 7, 31-48.

Bauer, W. F. (1958). The Monte Carlo Method. J. of S.I.A.M., 6, 438-451.

Bofinger, E., Bofinger, V. J. (1958). On a periodic property of pseudorandom sequences. J.A.C.M., 5, 261-265.

Certaine, J. E. (1958). On sequences of pseudorandom numbers of maximal length. J.A.C.M., 5, 353-356.

Franklin, J. N. (1958). On the equidistribution of pseudorandom numbers. Quart. Appl. Math., 16, 183-188.

Gross, O., Johnson, S. M. (1958). Additive Generation of Pseudorandom Numbers. RAND memorandum RM-2132.

Sobol, I. M. (1958). Pseudorandom numbers for the machine STRELA. (Translated from the Russian.) Theory of Probability and its Applications, 3, 192-197.

Thomson, W. E. (1958). A modified congruence method of generating pseudorandom numbers. Computer J., 1, pp. 83, 86.

Good, I. J. (1957). On the serial test for random sequences. Ann. Math. Stat., 28, 262-264.

Spencer Brown, G. (1957). Probability and Scientific Inference. Longmans.

von Mises, R. (1957). Probability, Statistics and Truth. George Allen & Unwin. George Allen & Unwin.

Johnson, D. L. (1956). Generating and testing pseudorandom numbers on the I.B.M. type 70 M.T.A.C., 10, 8-13.

Kahn, H. (1956). Applications of Monte Carlo. RAND Memorandum RM-1237-AEC, Ch. I and Appendix I.

Stuart, A. (1956). The efficiencies of tests of randomness, distribution-free methods vs. normal alternatives. J.A.S.A., Part II, 51, 285-287.

Taussky, O., Todd, J. (1956). Generation and testing of pseudorandom numbers. In Symposium on Monte Carlo Methods (ed. H. A. Meyer) (pp. 15-28). Wiley.

Greenwood, R. E. (1955). Coupon collector's test for random digits. M.T.A.C., 9, 1-5.

Royo, J., Ferrer, S. (1954). Tables of random numbers obtained from numbers in the Spanish National Lottery. (In Spanish.) Trabajos de Estadistica, 5, 247-256.

Stuart, A. (1954). The efficiencies of tests of randomness, distribution-free methods vs. normal alternatives. J.A.S.A., Part I, 49, 147-157.

von Schelling, H. (1954). Coupon collecting for unequal probabilities. Amer. Math. Monthly, 61, 306-311.

Duparc, H. J., Lekkerkerker, C. G., Peremans, W. (1953). Reduced Sequences of Integers and Pseudorandom Numbers. Report no. ZW 1953-002 Mathematisch Centrum, Amsterdam.

Good, I. J. (1953). The serial test for sampling numbers and other tests for randomness. Proc. Cambridge Philos. Soc. (276-284).

Juncosa, M. L. (1953). Random Number Generation on the BRL High-speed Computing Machines. Report no. 855, Maryland, U.S.A.: Ballistic Research Laboratories, Aberdeen Proving Ground.

Moore, P. G. (1953). A sequential test for randomness. Biometrika, 40, 111-115.

Cameron, J. M. (1952). Results of some tests of randomness on pseudorandom numbers. (Abstract.) Ann. Math. Stat., 23, 138.

Gruenberger, F., Mark, A. M. (1951). The d^2 test of random digits. M.T.A.C., 5, 109-110.

Lehmer, D. H. (1951). Mathematical methods in large scale computing units. Annals Comp. Lab. Harvard, 26, 141-146.

Gruenberger, F. (1950). Tests of random digits. M.T.A.C., 4, 244-245.

Olmstead, P. S. (1946). Distribution of sample arrangements for runs up and down. Ann. Math. Stat., 17, 24-33.

Levene, H., Wolfowitz, J. (1944). The covariance matrix of runs up and down. Ann. Math. Stat., 15, 58-69.

Wolfowitz, J. (1944). Asymptotic distribution of runs up and down. Ann. Math. Stat., 15, 163-172.

Swed, F. S., Eisenhart, C. (1943). Tables for testing randomness of grouping in a sequence of alternatives. Ann. Math. Stat., 14, 66-87.

Wald, A., Wolfowitz, J. (1943). An exact test for randomness in the non-parametric case, based on serial correlation. Ann. Math. Stat., 14, 378-388.

Dodd, E. L. (1942). A transformation of Tippett's random sampling numbers into numbers normally distributed. Bol. Math., 15, 73-77.

Rosander, A. C. (1942). The use of inversions as a test of random order. J.A.S.A., 37, 352-358.

Kendall, M. G. (1941). A theory of randomness. Biometrika, 32, 1-15.

Young, L. C. (1941). On randomness in ordered sequences. Ann. Math. Stat., 12, 293-300.

Church, A. (1940). On the concept of a random sequence. Bull. Amer. Math. Soc., 46, 130-135.

Kendall, M. G., Babington Smith, B. (1938). Randomness and random sampling numbers. J.R.S.S., A, 101, 147-166.

Kermack, W. O., McKendrick, A. G. (1937). Tests for randomness in a series of numerical observations. Proc. Roy. Soc. Edinburgh (228-240).

Kermack, W. O., McKendrick, A. G. (1937). Some distributions associated with a randomly arranged set of numbers. Proc. Roy. Soc. Edinburgh (332-376).

Copyright © 2010 The Quantum World Corporation. The QNG models J20KP, J1000KU, R2000KU and the PCQNG are covered by one or more of the following Patents: U.S. Patent No(s).: 6,324,558; 6,763,364; 6,862,605; 7,096,242, 7,752,247