ACM Home Page
Please provide us with feedback. Feedback
Uniform random number generators: a review
Full text PdfPdf (927 KB)
Source Winter Simulation Conference archive
Proceedings of the 29th conference on Winter simulation table of contents
Atlanta, Georgia, United States
Pages: 127 - 134  
Year of Publication: 1997
ISBN:0-7803-4278-X
Author
Pierre L'Ecuyer  Département d'IRO, Université de Montréal, C.P. 6128, Succ. Centre-Ville, Montréal, H3C 3J7, Canada
Sponsors
IEEE-CS : Computer Society
IEEE-SMCS : Systems, Man & Cybernetics Society
ACM: Association for Computing Machinery
INFORMS/CS : Computer Science TC
SIGSIM: ACM Special Interest Group on Simulation and Modeling
SCS : Society for Computer Simulation
ASA : American Statistical Association
IEEE : Institute of Electrical and Electronics Engineers
Publisher
IEEE Computer Society  Washington, DC, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 77,   Citation Count: 1
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/268437.268461
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
Compagner, A. 1991. The hierarchy of correlations in random binary sequences. Journal of Statistical Physics 63:883-896.
 
4
 
5
 
6
 
7
 
8
Couture, R., P. L'Ecuyer, and S. Tezuka. 1993. On the distribution of k-dimensional vectors for simple and combined Tausworthe sequences. Mathematics of Computation 60(202):749-761, Sll- S16.
 
9
Eichenauer-Herrmann, J. 1992. Inversive congruential pseudorandom numbers: A tutorial. Znternational Statistical Reviews 60:167-J 76.
 
10
Eichenauer-Herrmann, J. 1993. Statistical independence of a new class of inversive congruential pseudorandom numbers. Mathematics of Computation 60:375-384.
 
11
Eichenauer-Herrmann, J. 1995. Pseudorandom number generation by nonlinear methods. International Statistical Reviews 63:247-255.
 
12
Ferrenberg, A. M., D. P. Landau, and Y. J. Wong. 1992. Monte Carlo simulations: Hidden errors from "good" random number generators. Physical Review Letters 69(23):3382-3384.
 
13
Fishman, G. S. 1996. Monte Carlo: Concepts, Algorithms, and Applications. Springer Series in Operations Research, New York: Springer-Verlag.
 
14
Fushimi, M. 1989. An equivalence relation between Tausworthe and GFSR sequences and applications. Applied Mathematics Letters 2(2):135-137.
15
 
16
 
17
James, F. 1994. RANLUX: A Fortran implementation of the high-quality pseudorandom number generator of Liischer. Computer Physics Communications 79:111-114.
 
18
 
19
Lagarias, J. C. 1993. Pseudorandom numbers. Statistical Science 8(1):31-39.
20
21
 
22
L'Ecuyer, P. 1994. Uniform random number generation. Annals of Operations Research 53:77-120.
 
23
L'Ecuyer, P. 1996a. Combined multiple recursive generators. Operations Research 44(5):816-822.
 
24
 
25
L'Ecuyer, P. 1996c. TestUOl: Un logiciel pour appliquer des tests statistiques & des g&Crateurs de valeurs alkatoires. In preparation.
 
26
L'Ecuyer, P. 1997a. Bad lattice structures for vectors of non-successive values produced by some linear recurrences. INFORMS Journal on Computing 9(1):57-60.
 
27
L'Ecuyer, P. 1997b. Good parameter sets for combined multiple recursive random number generators. Manuscript.
 
28
L'Ecuyer, P. 1997c. Random number generation. In Handbook on Simulation, ed. J. Banks. Wiley. To appear. Also GERAD technical report number G-96-38.
 
29
L'Ecuyer, P. 1997d. A table of linear congruential generators of different sizes and good lattice structure. Manuscript.
 
30
L'Ecuyer, P. 1997e. Tables of maximally equidistributed combined LFSR generators. Manuscript.
 
31
L'Ecuyer, P. 1997f. Tests based on sum-functions of spacings for uniform random numbers. Journal of Statistical Computation and Simulation. To appear.
 
32
 
33
L'Ecuyer, P., A. Compagner, and J.-F. Cordeau. 1996. Entropy-based tests for random number generators. Submitted.
 
34
L'Ecuyer, P., J.-F. Cordeau, and R. Simard. 1997. Close-point spatial tests for random number generators. Submitted.
35
 
36
L'Ecuyer, P., and R. Couture. 1997. An implementation of the lattice and spectral tests for multiple recursive linear random number generators. IN- FORMS Journal on Computing g(2). To appear.
37
 
38
L'Ecuyer, P., and S. Tezuka. 1991. Structural properties for two classes of combined random number generators. Mathematics of Computation 57(196):735-746.
39
 
40
Marsaglia, G. 1985. A current view of random number generators. In Computer Science and Statistics, Sixteenth Symposium on the Interface, 3- 10, North-Holland, Amsterdam. Elsevier Science Publishers.
 
41
Marsaglia, G. 1994. Yet another rng. Posted to the electronic billboard sci. stat .math, August 1.
 
42
Marsaglia, G. 1996. Diehard: A battery of tests of randomness. Available on the internet at http://stat.fsu.edu/Ngeo/diehard.html.
 
43
Marsaglia, G., B. Narasimhan, and A. Zaman. 1990. A random number generator for PCs. Computer Physics Communications 60:345-349.
 
44
Marsaglia, G., and A. Zaman. 1991. A new class of random number generators. The Annals of Applied Probability 1:462-480.
 
45
Marsaglia, G., A. Zaman, and W. W. Tsang. 1990. Towards a universal random number generator. Statistics and Probability Letters 8:35-39.
46
47
 
48
Matsumoto, M., and T. Nishimura. 1997. Mersenne twister: A 623-dimensionally equidistributed uniform pseudorandom number generator. Submitted.
 
49
 
50
51
 
52
Niederreiter, H. 1995a. The multiple-recursive matrix method for pseudorandom number generation. Finite Fields and their Applications 1:3-30.
 
53
Niederreiter, H. 199513. New developments in uniform pseudorandom number and vector generation. In Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing, ed. H. Niederreiter and P. J.-S. Shiue, number 106 in Lecture Notes in Statistics, 87-120. Springer-Verlag.
 
54
 
55
Stephens, M. S. 1986. Tests for the uniform distribution. In Goodness-of-Fit Techniques, ed. R. B. D'Agostino and M. S. Stephens, 331-366. Marcel Dekker, New York and Basel.
 
56
Tausworthe, R. C. 1965. Random numbers generated by linear recurrence modulo two. Mathematics of Computation 19:201-209.
 
57
Tezuka, S. 1995. Uniform Random Numbers: Theory and Practice. Norwell, Massachusetts: Kluwer Academic Publishers.
58
 
59
Wang, D., and A. Compagner. 1993. On the use of reducible polynomials as random number generators. Mathematics of Computation 601363-374.