Normal Random Numbers: Using Machine Analysis to Choose the Best Algorithm
- 1 December 1977
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 3 (4), 346-358
- https://doi.org/10.1145/355759.355763
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Permutation enumerationCommunications of the ACM, 1976
- Algorithm 488: A Gaussian pseudo-random number generatorCommunications of the ACM, 1974
- Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial ConfigurationsJournal of the ACM, 1973
- A combinatorial method for the generation of normally distributed random numbersComputing, 1973
- Computer methods for sampling from the exponential and normal distributionsCommunications of the ACM, 1972
- Algorithm 334: Normal random deviatesCommunications of the ACM, 1968
- A Convenient Method for Generating Normal VariablesSIAM Review, 1964
- A fast procedure for generating normal random variablesCommunications of the ACM, 1964
- Pseudo Division and Pseudo Multiplication ProcessesIBM Journal of Research and Development, 1962
- An Inverse Method for The Generation of Random Normal Deviates on Large-Scale ComputersMathematical Tables and Other Aids to Computation, 1958