The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Fourier Analysis of Uniform Random Number Generators
Open accessAbstract
A method of analysis of uniform random number generators is developed, applicable to almost all practical methods of generation. The method is that of Fourier analysis of the output sequences of such generators. With this tool it is possible to understand and predict relevant statistical properties of such generators and compare and evaluate such methods. Many such analyses and comparisons have been carried out. The performance of these methods as implemented on differing computers is also studied. The main practical conclusions of the study are: (a) Such a priori analysis and prediction of statistical behavior of uniform random number generators is feasible. (b) The commonly used multiplicative congruence method of generation is satisfactory with careful choice of the multiplier for computers with an adequate (≥ ∼ 35-bit) word length. (c) Further work may be necessary on generators to be used on machines of shorter word length.
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
Hull, T. E., & Dobell, A. R. (1962) · SIAM Review · doi:10.1137/1004061 · Cited by 333
Uniform Random Number Generators
MacLaren, M. D., & Marsaglia, G. (1965) · Journal of the ACM · doi:10.1145/321250.321257 · Cited by 242
Cited by
A Method for Comparing Two Hierarchical Clusterings
Fowlkes, E. B., & Mallows, C. L. (1983) · Journal of the American Statistical Association · doi:10.1080/01621459.1983.10478008 · Cited by 1,614
Closest point search in lattices
Agrell, E., Eriksson, T., Vardy, A., & Zeger, K. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.800499 · Cited by 1,412
Random number generators: good ones are hard to find
Park, S. K., & Miller, K. W. (1988) · Communications of the ACM · doi:10.1145/63039.63042 · Cited by 1,262
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
Quasi-Monte Carlo methods and pseudo-random numbers
Niederreiter, H. (1978) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1978-14532-7 · Cited by 806
Monte Carlo and Quasi-Monte Carlo Sampling
(2009) · Springer Series in Statistics · doi:10.1007/978-0-387-78165-5 · Cited by 497
Efficient and portable combined random number generators
L'Ecuyer, P. (1988) · Communications of the ACM · doi:10.1145/62959.62969 · Cited by 494
H�non, M. (1971) · Astrophysics and Space Science · doi:10.1007/bf00649201 · Cited by 464
The Analysis of Ranked Data Derived from Completely Randomized Factorial Designs
Scheirer, C. J., Ray, W. S., & Hare, N. (1976) · Biometrics · doi:10.2307/2529511 · Cited by 397
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
A Retrospective and Prospective Survey of the Monte Carlo Method
Halton, J. H. (1970) · SIAM Review · doi:10.1137/1012001 · Cited by 348
Generalized Feedback Shift Register Pseudorandom Number Algorithm
Lewis, T. G., & Payne, W. H. (1973) · Journal of the ACM · doi:10.1145/321765.321777 · Cited by 312
Monte Carlo Calculations for Hard Disks in the Isothermal-Isobaric Ensemble
Wood, W. W. (1968) · The Journal of Chemical Physics · doi:10.1063/1.1667938 · Cited by 260
Recent Advances in Randomized Quasi-Monte Carlo Methods
L’Ecuyer, P., & Lemieux, C. (2002) · International Series in Operations Research & Management Science · doi:10.1007/0-306-48102-2_20 · Cited by 254
Graphics and managerial decision making: research-based guidelines
Jarvenpaa, S. L., & Dickson, G. W. (1988) · Communications of the ACM · doi:10.1145/62959.62971 · Cited by 253
Parallel random number generation for VLSI systems using cellular automata
Hortensius, P. D., McLeod, R. D., & Card, H. C. (1989) · IEEE Transactions on Computers · doi:10.1109/12.35843 · Cited by 225
Bad subsequences of well-known linear congruential pseudorandom number generators
Entacher, K. (1998) · ACM Transactions on Modeling and Computer Simulation · doi:10.1145/272991.273009 · Cited by 51
Exploiting Diversity in Android TLS Implementations for Mobile App Traffic Classification
Sengupta, S., Ganguly, N., De, P., & Chakraborty, S. (2019) · The World Wide Web Conference · doi:10.1145/3308558.3313738 · Cited by 45
“which suggested employing Fourier analysis to analyze the quality of random number generators [19].”
MethodParapsychology is science, but its findings are inconclusive
Akers, C. (1987) · Behavioral and Brain Sciences · doi:10.1017/s0140525x00054480 · Cited by 11
Metadata
- Authors
- Coveyou, R. R., & Macpherson, R. D.
- Venue
- Journal of the ACM
- Published
- 1967-01
- Volume
- 14
- Issue
- 1
- Pages
- 100-119
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W1973321757
- Cited by
- 295
- References
- 2
- FWCI
- 7.79
- 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.