High speed sampling

Authors:
D. F. Votaw and J. A. Rafferty

Journal:
Math. Comp. **5** (1951), 1-8

MSC:
Primary 62.0X

DOI:
https://doi.org/10.1090/S0025-5718-1951-0039181-8

Corrigendum:
Math. Comp. **5** (1951), 184.

MathSciNet review:
0039181

Full-text PDF

References | Similar Articles | Additional Information

**[3]**In connection with this topic we may cite the following references. H. Burke Horton, ``A method for obtaining random numbers,''*Annals Math. Stat.*, v. 19, 1948, p. 81-85. John E. Walsh, ``Concerning compound randomization in the binary system,''*Annals Math. Stat.*, v. 20, 1949, p. 580-589. John E. Walsh, ``On a method of obtaining random binary digits by flipping coins,'' unpublished manuscript, Project RAND, Santa Monica, Calif., July, 1948. John W. Mauchly, ``Pseudo-random numbers,'' unpublished report, presented Dec. 29, 1949 to the American Statistical Association. D. H. Lehmer, ``Mathematical methods in large scale computing,'' unpublished address presented at Harvard University Symposium, Sept., 1949.

Retrieve articles in *Mathematics of Computation*
with MSC:
62.0X

Retrieve articles in all journals with MSC: 62.0X

Additional Information

DOI:
https://doi.org/10.1090/S0025-5718-1951-0039181-8

Article copyright:
© Copyright 1951
American Mathematical Society