Algorithm 647: Implementation and Relative Efficiency of Quasirandom Sequence Generators
- 1 December 1986
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 12 (4) , 362-376
- https://doi.org/10.1145/22721.356187
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- The serial test for pseudo-random numbers generated by the linear congruential methodNumerische Mathematik, 1985
- Discrépance de suites associées à un système de numération (en dimension s)Acta Arithmetica, 1982
- Optimization of functions by quasi-random search methodsComputing, 1979
- An economic method of computing LPτ-sequencesUSSR Computational Mathematics and Mathematical Physics, 1979
- Quasi-Monte Carlo methods and pseudo-random numbersBulletin of the American Mathematical Society, 1978
- Uniformly distributed sequences with an additional uniform propertyUSSR Computational Mathematics and Mathematical Physics, 1976
- Pseudo-random numbers for constructing discrete Markov chains by the Monte Carlo methodUSSR Computational Mathematics and Mathematical Physics, 1974
- Algorithm 247: Radical-inverse quasi-random point sequenceCommunications of the ACM, 1964
- Funktionen von beschränkter Variatiou in der Theorie der GleichverteilungAnnali di Matematica Pura ed Applicata (1923 -), 1961
- On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integralsNumerische Mathematik, 1960