The DOI matches its Crossref record.
Random number generators: good ones are hard to find
Open accessAbstract
Practical and theoretical issues are presented concerning the design, implementation, and use of a good, minimal standard random number generator that will port to virtually all systems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cited by
Handbook of frequency stability analysis
Riley, W. J., & Riley, W. J. (2008) · doi:10.6028/nist.sp.1065 · Cited by 586
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
Parallel random numbers: as easy as 1, 2, 3
Salmon, J. K., Moraes, M. A., Dror, R. O., & Shaw, D. E. (2011) · Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis · doi:10.1145/2063384.2063405 · Cited by 227
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
Sparse serial tests of uniformity for random number generators
L'Ecuyer, P., Simard, R., & Wegenkittl, S. (2002) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827598349033 · Cited by 50
Metadata
- Authors
- Park, S. K., & Miller, K. W.
- Venue
- Communications of the ACM
- Published
- 1988-10
- Volume
- 31
- Issue
- 10
- Pages
- 1192-1201
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2011398297
- Cited by
- 1,262
- References
- 0
- FWCI
- 25.94
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Random number generators: good ones are hard to find. https://app.cochat.ai/papers/10.1145/63039.63042
- The paper
- Park, S. K., & Miller, K. W. (1988). Random number generators: good ones are hard to find. Communications of the ACM. https://doi.org/10.1145/63039.63042
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.
