Algorithm 488: A Gaussian pseudo-random number generator
- 1 December 1974
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 17 (12), 704-706
- https://doi.org/10.1145/361604.361629
Abstract
The algorithm calculates the exact cumulative distribution of the two-sided Kolmogorov-Smirnov statistic for samples with few observations. The general problem for which the formula is needed is to assess the probability that a particular sample comes from a proposed distribution. The problem arises specifically in data sampling and in discrete system simulation. Typically, some finite number of observations are available, and some underlying distribution is being considered as characterizing the source of the observations.Keywords
This publication has 7 references indexed in Scilit:
- Computer methods for sampling from the exponential and normal distributionsCommunications of the ACM, 1972
- Algorithm 426: Merge sort algorithm [M1]Communications of the ACM, 1972
- SortingACM Computing Surveys, 1971
- Algorithm 334: Normal random deviatesCommunications of the ACM, 1968
- The Traveling Salesman Problem: A SurveyOperations Research, 1968
- A Modification of Lee's Path Connection AlgorithmIEEE Transactions on Electronic Computers, 1967
- An Algorithm for Path Connections and Its ApplicationsIEEE Transactions on Electronic Computers, 1961