The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Generalized Feedback Shift Register Pseudorandom Number Algorithm
Open accessAbstract
The generalized feedback shift register pseudorandom number algorithm has several advantages over all other pseudorandom number generators. These advantages are: (1) it produces multidimensional pseudorandom numbers; (2) it has an arbitrarily long period independent of the word size of the computer on which it is implemented; (3) it is faster than other pseudorandom number generators; (4) the “same” floating-point pseudorandom number sequence is obtained on any machine, that is, the high order mantissa bits of each pseudorandom number agree on all machines— examples are given for IBM 360, Sperry-Rand-Univac 1108, Control Data 6000, and Hewlett-Packard 2100 series computers; (5) it can be coded in compiler languages (it is portable); (6) the algorithm is easily implemented in microcode and has been programmed for an Interdata computer.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
RANDOM NUMBERS FALL MAINLY IN THE PLANES
Marsaglia, G. (1968) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.61.1.25 · Cited by 521
Random numbers generated by linear recurrence modulo two
Tausworthe, R. C. (1965) · Mathematics of Computation · doi:10.1090/s0025-5718-1965-0184406-1 · Cited by 441
A pseudo-random number generator for the System/360
Lewis, P. A. W., Goodman, A. S., & Miller, J. M. (1969) · IBM Systems Journal · doi:10.1147/sj.82.0136 · Cited by 370
Fourier Analysis of Uniform Random Number Generators
Coveyou, R. R., & Macpherson, R. D. (1967) · Journal of the ACM · doi:10.1145/321371.321379 · Cited by 295
Uniform Random Number Generators
MacLaren, M. D., & Marsaglia, G. (1965) · Journal of the ACM · doi:10.1145/321250.321257 · Cited by 242
An Asymptotically Random Tausworthe Sequence
Tootill, J. P. R., Robinson, W. D., & Eagle, D. J. (1973) · Journal of the ACM · doi:10.1145/321765.321778 · Cited by 88
Primitive trinomials whose degree is a Mersenne exponent
Zierler, N. (1969) · Information and Control · doi:10.1016/s0019-9958(69)90631-7 · Cited by 87
A comparison of the correlational behavior of random number generators for the IBM 360
Whittlesey, J. R. (1968) · Communications of the ACM · doi:10.1145/364063.364095 · Cited by 59
Cited by
Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator
Matsumoto, M., & Nishimura, T. (1998) · ACM Transactions on Modeling and Computer Simulation · doi:10.1145/272991.272995 · Cited by 5,780
Handbook of Monte Carlo Methods
Kroese, D. P., Taimre, T., & Botev, Z. I. (2011) · Wiley Series in Probability and Statistics · doi:10.1002/9781118014967 · Cited by 1,104
A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
Padberg, M., & Rinaldi, G. (1991) · SIAM Review · doi:10.1137/1033004 · Cited by 1,097
Monte Carlo and Quasi-Monte Carlo Sampling
(2009) · Springer Series in Statistics · doi:10.1007/978-0-387-78165-5 · Cited by 497
Does psi exist? Replicable evidence for an anomalous process of information transfer.
Bem, D. J., & Honorton, C. (1994) · Psychological Bulletin · doi:10.1037/0033-2909.115.1.4 · Cited by 330
Ising universality in three dimensions: a Monte Carlo study
Blote, H. W. J., Luijten, E., & Heringa, J. R. (1995) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/28/22/007 · Cited by 307
L'Ecuyer, P. (1990) · Communications of the ACM · doi:10.1145/84537.84555 · Cited by 282
Uniform random number generation
L'Ecuyer, P. (1994) · Annals of Operations Research · doi:10.1007/bf02136827 · Cited by 279
Algorithm 806: SPRNG: a scalable library for pseudorandom number generation
Mascagni, M., & Srinivasan, A. (2000) · ACM Transactions on Mathematical Software · doi:10.1145/358407.358427 · Cited by 275
Statistics of chaotic binary sequences
Kohda, T., & Tsuneda, A. (1997) · IEEE Transactions on Information Theory · doi:10.1109/18.567654 · Cited by 275
A very fast shift-register sequence random number generator
Kirkpatrick, S., & Stoll, E. P. (1981) · Journal of Computational Physics · doi:10.1016/0021-9991(81)90227-8 · Cited by 252
Matrices and the structure of random number sequences
Marsaglia, G., & Tsay, L.-H. (1985) · Linear Algebra and its Applications · doi:10.1016/0024-3795(85)90192-2 · Cited by 118
Metadata
- Authors
- Lewis, T. G., & Payne, W. H.
- Venue
- Journal of the ACM
- Published
- 1973-07
- Volume
- 20
- Issue
- 3
- Pages
- 456-468
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2020736457
- Cited by
- 312
- References
- 8
- FWCI
- 1.72
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.