TestU01: A C library for empirical testing of random number generators

Abstract

We introduce TestU01, a software library implemented in the ANSI C language, and offering a collection of utilities for the empirical statistical testing of uniform random number generators (RNGs). It provides general implementations of the classical statistical tests for RNGs, as well as several others tests proposed in the literature, and some original ones. Predefined tests suites for sequences of uniform random numbers over the interval (0, 1) and for bit sequences are available. Tools are also offered to perform systematic studies of the interaction between a specific test and the structure of the point sets produced by a given family of RNGs. That is, for a given kind of test and a given class of RNGs, to determine how large should be the sample size of the test, as a function of the generator's period length, before the generator starts to fail the test systematically. Finally, the library provides various types of generators implemented in generic form, as well as many specific generators proposed in the literature or found in widely used software. The tests can be applied to instances of the generators predefined in the library, or to user-defined generators, or to streams of random numbers produced by any kind of device or stored in files. Besides introducing TestU01, the article provides a survey and a classification of statistical tests for RNGs. It also applies batteries of tests to a long list of widely used RNGs.

References

1. Agarwal, R. C., Enenkel, R. F., Gustavson, F. G., Kothari, A., and m. Zubair. 2002. Fast pseudorandom-number generators with modulus 2^k or 2^k − 1 using fused multiply-add. IBM J. Res. and Dev. 46, 1, 97--116.
2. Anderson, T. W. and Darling, D. A. 1952. Asymptotic theory of certain goodness of fit criteria based on stochastic processes. Ann. Math. Stat. 23, 193--212.
3. Barker, E. and Kelsey, J. 2006. Recommendation for random number generation using deterministic random bit generators. SP-800-90, U.S. DoC/National Institute of Standards and Technology. http://csrc.nist.gov/publications/nistpubs/.
4. Berlekamp, E. R. 1984. Algebraic Coding Theory. Aegean Park Press, Laguna Hills, CA.
5. Bickel, P. J. and Breiman, L. 1983. Sums of functions of nearest neighbor distances, moment bounds, limit theorems and a goodness of fit test. Ann. Probab. 11, 1, 185--214.
6. Brent, R. P. 2004. Note on Marsaglia's xorshift random number generators. J. Statis. Softw. 11, 5, 1--4. http://www.jstatsoft.org/v11/i05/brent.pdf.
7. Brown, F. B. and Nagaya, Y. 2002. The MCNP5 random number generator. Tech. rep. LA-UR-02-3782, Los Alamos National Laboratory.
8. Carter, G. D. 1989. Aspects of local linear complexity. Ph.D. thesis, University of London.
9. Couture, R. and L'Ecuyer, P. 1994. On the lattice structure of certain linear congruential sequences related to AWC/SWB generators. Mathem. Comput. 62, 206, 798--808.
10. Couture, R. and L'Ecuyer, P. 1997. Distribution properties of multiply-with-carry random number generators. Mathem. Comput. 66, 218, 591--607.
11. Coveyou, R. R. 1969. Random number generation is too important to be left to chance. In Applied Probability and Monte Carlo Methods and Modern Aspects of Dynamics. Studies in Applied Mathematics 3. Society for Industrial and Applied Mathematics, Philadelphia, PA. 70--111.
12. Daemen, J. and Rijmen, V. 2002. The Design of Rijndael. Springer-Verlag, Berlin, Germany. http://www.esat.kuleuven.ac.be/~rijmen/rijndael/.
13. Darling, D. A. 1960. On the theorems of Kolmogorov-Smirnov. Theo. Probab. Applic. V, 4, 356--360.
14. Deng, L.-Y. 2005. Efficient and portable multiple recursive generators of large order. ACM Trans. Model. Comput. Simul. 15, 1, 1--13.
15. Deng, L.-Y. and Lin, D. K. J. 2000. Random number generation for the new century. Ame. Statis. 54, 2, 145--150.
16. Durbin, J. 1973. Distribution theory for tests based on the sample distribution function. SIAM CBMS-NSF Regional Conference Series in Applied Mathematics. SIAM, Philadelphia, PA.
17. Eichenauer, J. and Lehn, J. 1986. A nonlinear congruential pseudorandom number generator. Statistische Hefte 27, 315--326.
18. Eichenauer-Herrmann, J. 1992. Inversive congruential pseudorandom numbers: A tutorial. Inte. Statist. Rev. 60, 167--176.
19. Erdmann, E. D. 1992. Empirical tests of binary keystreams. M.S. thesis, Department of Mathematics, Royal Holloway and Bedford New College, University of London.
20. Feller, W. 1968. An Introduction to Probability Theory. Vol. 1, 3rd Ed. John Wiley, New York, NY.
21. Ferrenberg, A. M., Landau, D. P., and Wong, Y. J. 1992. Monte Carlo simulations: Hidden errors from “good” random number generators. Phy. Rev. Lett. 69, 23, 3382--3384.
22. Fishman, G. S. 1990. Multiplicative congruential random number generators with modulus 2^β: An exhaustive analysis for β = 32 and a partial analysis for β = 48. Mathem. Comput. 54, 189 (Jan), 331--344.
23. Fishman, G. S. 1996. Monte Carlo: Concepts, Algorithms, and Applications. Springer Series in Operations Research. Springer-Verlag, Berlin, Germany.
24. Fishman, G. S. and Moore III, L. S. 1986. An exhaustive analysis of multiplicative congruential random number generators with modulus 2³¹ − 1. SIAM J. Sci. Statist. Comput. 7, 1, 24--45.
25. Földes, A. 1979. The limit distribution of the length of the longest head run. Period Math. Hung. 10, 4, 301--310.
26. Galassi, M., Davies, J., Theiler, J., Gough, B., Jungman, G., Booth, M., and Rossi, F. 2004. GSL -- GNU Scientific Library: Reference manual. http://www.gnu.org/software/gsl/.
27. Gammel, B. M. 2005. Matpack C++ Numerics and Graphics Library, Release 1.8.1. http://users.physik.tu-muenchen.de/gammel/matpack/index.html.
28. Goldreich, O. 1999. Modern Cryptography, Probabilistic Proofs and Pseudo-Randomness. Springer-Verlag, Berlin, Germany.
29. Good, I. J. 1953. The serial test for sampling numbers and other tests for randomness. In Proceedings of the Cambridge Philosophical Society 49, 276--284.
30. Gordon, L., Schilling, M. F., and Waterman, S. 1986. An extreme value theory for long head runs. Probab. Theo. Relat. Fields 72, 279--287.
31. Greenwood, R. E. 1955. Coupon collector's test for random digits. Math. Tables Aids Comput. 9, 1--5, 224, 229.
32. Hellekalek, P. 1995. Inversive pseudorandom number generators: Concepts, results, and links. In Proceedings of the 1995 Winter Simulation Conference, C. Alexopoulos, K. Kang, W. R. Lilegdon, and D. Goldsman, Eds. IEEE Press, 255--262.
33. Hellekalek, P. 1998. Don't trust parallel Monte Carlo! In 12th Workshop on Parallel and Distributed Simulation. Banff, Canada. IEEE Computer Society, Los Alamitos, CA, 82--89.
34. Hellekalek, P. and Wegenkittl, S. 2003. Empirical evidence concerning AES. ACM Trans. Model. Comput. Simul. 13, 4, 322--333.
35. Holian, B. L., Percus, O. E., Warnock, T. T., and Whitlock, P. A. 1994. Pseudorandom number generator for massively parallel molecular-dynamics simulations. Phys. Rev. E 50, 2, 1607--1615.
36. IBM 1968. System/360 Scientific Subroutine Package. Version III, Programmer's Manual. IBM, White Plains, New York.
37. IMSL. 1997. IMSL STAT/LIBRARY. Visual Numerics Inc., Houston, TX. http://www.vni.com/books/dod/pdf/STATVol_2.pdf.
38. Intel. 2003. Vector statistical library notes. Tech. rep. version 3, Intel Corporation. http://www.intel.com/software/products/mkl/docs/vslnotes.pdf.
39. James, F. 1994. RANLUX: A Fortran implementation of the high-quality pseudorandom number generator of Lüscher. Comput. Phys. Comm. 79, 111--114.
40. Jenkins, B. 1996. ISAAC. in fast software encryption. In Proceedings of the 3rd International Workshop. Cambridge, UK, D. Gollmann, Ed. Lecture Notes in Computer Science, vol. 1039. Springer-Verlag, 41--49. http://burtleburtle.net/bob/rand/isaacafa.html.
41. Kendall, M. G. and Babington-Smith, B. 1939. Second paper on random sampling numbers. J. Royal Statis. Soc. Suppl. 6, 51--61.
42. Kirkpatrick, S. and Stoll, E. 1981. A very fast shift-register sequence random number generator. J. Comput. Physics 40, 517--526.
43. Kirschenhofer, P., Prodinger, H., and Szpankowski, W. 1994. Digital search trees again revisited: The internal path length perspective. SIAM J. Comput. 23, 598--616.
44. Knuth, D. E. 1981. The Art of Computer Programming. Vol. 2: Seminumerical Algorithms, 2nd Ed. Addison-Wesley, Reading, MA.
45. Knuth, D. E. 1998. The Art of Computer Programming. Vol. 2: Seminumerical Algorithms, 3rd ed. Addison-Wesley, Reading, MA.
46. Lagarias, J. C. 1993. Pseudorandom numbers. Statis. Sci. 8, 1, 31--39.
47. L'Ecuyer, P. 1988. Efficient and portable combined random number generators. Comm. ACM 31, 6, 742--749 and 774. (See also the correspondence in the same journal, 32, 8 (1989) 1019--1024.)
48. L'Ecuyer, P. 1990. Random numbers for simulation. Comm. ACM 33, 10, 85--97.
49. L'Ecuyer, P. 1992. Testing random number generators. In Proceedings of the 1992 Winter Simulation Conference. IEEE Press, 305--313.
50. L'Ecuyer, P. 1994. Uniform random number generation. Ann. Operat. Res. 53, 77--120.
51. L'Ecuyer, P. 1996a. Combined multiple recursive random number generators. Operat. Res. 44, 5, 816--822.
52. L'Ecuyer, P. 1996b. Maximally equidistributed combined Tausworthe generators. Mathem. Comput. 65, 213, 203--213.
53. L'Ecuyer, P. 1997a. Bad lattice structures for vectors of non-successive values produced by some linear recurrences. INFORMS J. Comput. 9, 1, 57--60.
54. L'Ecuyer, P. 1997b. Tests based on sum-functions of spacings for uniform random numbers. J. Stat. Comput. Simul. 59, 251--269.
55. L'Ecuyer, P. 1999a. Good parameters and implementations for combined multiple recursive random number generators. Operat. Res. 47, 1, 159--164.
56. L'Ecuyer, P. 1999b. Tables of maximally equidistributed combined LFSR generators. Mathem. Comput. 68, 225, 261--269.
57. L'Ecuyer, P. 2001. Software for uniform random number generation: Distinguishing the good and the bad. In Proceedings of the Winter Simulation Conference. IEEE Press, 95--105.
58. L'Ecuyer, P. 2004. Random number generation. In Handbook of Computational Statistics, J. E. Gentle, W. Haerdle, and Y. Mori, Eds. Springer-Verlag, Berlin, Germany. 35--70. Chapter II.2.
59. L'Ecuyer, P. circa 2006. Uniform random number generation. In Stochastic Simulation, S. G. Henderson and B. L. Nelson, Eds. Handbooks of Operations Research and Management Science. Elsevier Science. To appear.
60. L'Ecuyer, P. and Andres, T. H. 1997. A random number generator based on the combination of four LCGs. Mathem. Comput. Simul. 44, 99--107.
61. L'Ecuyer, P., Blouin, F., and Couture, R. 1993. A search for good multiple recursive random number generators. ACM Tran. Model. Comput. Simul. 3, 2, 87--98.
62. L'Ecuyer, P. and Buist, E. 2005. Simulation in Java with SSJ. In Proceedings of the Winter Simulation Conference. IEEE Press, 611--620.
63. L'Ecuyer, P., Cordeau, J.-F., and Simard, R. 2000. Close-point spatial tests and their application to random number generators. Operat. Res. 48, 2, 308--317.
64. L'Ecuyer, P. and Granger-Piché, J. 2003. Combined generators with components from different families. Mathem. Comput Simul. 62, 395--404.
65. L'Ecuyer, P. and Hellekalek, P. 1998. Random number generators: Selection criteria and testing. In Random and Quasi-Random Point Sets, P. Hellekalek and G. Larcher, Eds. Lecture Notes in Statistics, vol. 138. Springer-Verlag, Berlin, Germany. 223--265.
66. L'Ecuyer, P. and Simard, R. 1999. Beware of linear congruential generators with multipliers of the form a = ± 2^q ± 2^r. ACM Trans. Math. Soft. 25, 3, 367--374.
67. L'Ecuyer, P. and Simard, R. 2001. On the performance of birthday spacings tests for certain families of random number generators. Mathem. Comput. Simul. 55, 1--3, 131--137.
68. L'Ecuyer, P., Simard, R., Chen, E. J., and Kelton, W. D. 2002. An object-oriented random-number package with many long streams and substreams. Operat. Res. 50, 6, 1073--1075.
69. L'Ecuyer, P., Simard, R., and Wegenkittl, S. 2002. Sparse serial tests of uniformity for random number generators. SIAM J. Scient. Comput. 24, 2, 652--668.
70. L'Ecuyer, P. and Touzin, R. 2000. Fast combined multiple recursive generators with multipliers of the form a = ± 2^q ± 2^r. In Proceedings of the Winter Simulation Conference, J. A. Joines, R. R. Barton, K. Kang, and P. A. Fishwick, Eds. IEEE Press, 683--689.
71. L'Ecuyer, P. and Touzin, R. 2004. On the Deng-Lin random number generators and related methods. Statis. Comput. 14, 5--9.
72. Lewis, P. A. W., Goodman, A. S., and Miller, J. M. 1969. A pseudo-random number generator for the system/360. IBM Syst. J. 8, 136--143.
73. Liang, Y. and Whitlock, P. A. 2001. A new empirical test for parallel pseudo-random number generators. Mathem. Comput. Simul. 55, 1--3, 149--158.
74. Lüscher, M. 1994. A portable high-quality random number generator for lattice field theory simulations. Comput. Physics Comm. 79, 100--110.
75. Maplesoft. 2006. Maple User Manual. Waterloo Maple Inc., Waterloo, Canada. http://www.maplesoft.com/products/maple/.
76. Marsaglia, G. 1972. The structure of linear congruential sequences. In Applications of Number Theory to Numerical Analysis, S. K. Zaremba, Ed. Academic Press, 249--285.
77. Marsaglia, G. 1985. A current view of random number generators. In Computer Science and Statistics, Sixteenth Symposium on the Interface. Elsevier Science Publishers, North-Holland, Amsterdam, The Netherlands. 3--10.
78. Marsaglia, G. 1996. DIEHARD: A battery of tests of randomness. http://stat.fsu.edu/~geo/diehard.html.
79. Marsaglia, G. 1997. A random number generator for C. Posted to the electronic billboard sci.math.num-analysis.
80. Marsaglia, G. 1999. Random numbers for C: The END? Posted to the electronic billboard sci.crypt.random-numbers.
81. Marsaglia, G. 2002. Good 64-bit RNG's. Posted to the electronic billboard sci.crypt.random-numbers.
82. Marsaglia, G. 2003. Xorshift RNGs. J. Statis. Soft. 8, 14, 1--6. http://www.jstatsoft.org/v08/i14/xorshift.pdf.
83. Marsaglia, G., Ananthanarayanan, K., and Paul, N. 1973. How to use the McGill random number package SUPER-DUPER. Tech. rep., School of Computer Science, McGill University, Montreal, Canada.
84. Marsaglia, G., Narasimhan, B., and Zaman, A. 1990. A random number generator for PC's. Comput. Physics Comm. 60, 345--349.
85. Marsaglia, G. and Tsang, W. W. 2002. Some difficult-to-pass tests of randomness. J. Statist. Soft. 7, 3, 1--9. http://www.jstatsoft.org/v07/i03/tuftests.pdf.
86. Marsaglia, G. and Tsay, L.-H. 1985. Matrices and the structure of random number sequences. Lin. Algebra Applic. 67, 147--156.
87. Marsaglia, G. and Zaman, A. 1991. A new class of random number generators. Ann. Appl. Proba. 1, 462--480.
88. Marsaglia, G. and Zaman, A. 1993a. The KISS generator. Tech. rep., Department of Statistics, University of Florida.
89. Marsaglia, G. and Zaman, A. 1993b. Monkey tests for random number generators. Comput. Math. Applic. 26, 9, 1--10.
90. Mascagni, M. and Srinivasan, A. 2000. Algorithm 806: SPRNG: A scalable library for pseudorandom number generation. ACM Trans. Mathem. Soft. 26, 436--461.
91. Massey, J. L. 1969. Shift-register synthesis and BCH decoding. IEEE Trans. Inf. Theor IT-15, 122--127.
92. MathSoft Inc. 2000. S-PLUS 6.0 Guide to Statistics. Vol. 2. Data Analysis Division, Seattle, WA.
93. Matsumoto, M. and Kurita, Y. 1992. Twisted GFSR generators. ACM Trans. Model. Comput. Simul. 2, 3, 179--194.
94. Matsumoto, M. and Kurita, Y. 1994. Twisted GFSR generators II. ACM Trans. Model. Comput. Simul. 4, 3, 254--266.
95. Matsumoto, M. and Nishimura, T. 1998. Mersenne twister: A 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Trans. Model. Comput. Simul. 8, 1, 3--30.
96. Maurer, J., Abrahams, D., Dawes, B., and Rivera, R. 2004. Boost random number library. http://www.boost.org/libs/random/index.html.
97. Maurer, U. M. 1992. A universal statistical test for random bit generators. J. Cryptol. 5, 2, 89--105.
98. Moler, C. 2004. Numerical Computing with MATLAB. SIAM, Philadelphia, PA.
99. NAG. 2002. The NAG C Library Manual, Mark 7. The Numerical Algorithms Group. http://www.nag.co.uk/numeric/cl/manual/pdf/G05/g05cac.pdf and http://www.nag.co.uk/numeric/fl/manual/pdf/G05/g05kaf.pdf.
100. Niederreiter, H. 1991. The linear complexity profile and the jump complexity of keystream sequences. In Advances in Cryptology: Proceedings of EUROCRYPT'90. Springer-Verlag, Berlin, Germany, 174--188.
101. Niederreiter, H. 1992. Random number generation and quasi-monte carlo methods. SIAM CBMS-NSF Regional Conference Series in Applied Mathematics, Vol. 63. SIAM, Philadelphia, PA.
102. NIST. 2001. Advanced encryption standard (AES). FIPS-197, U.S. DoC/National Institute of Standards and Technology. http://csrc.nist.gov/CryptoToolkit/tkencryption.html.
103. NIST. 2002. Secure hash standard (SHS). FIPS-186-2, with change notice added in february 2004, U.S. DoC/National Institute of Standards and Technology. http://csrc.nist.gov/CryptoToolkit/tkhash.html.
104. Panneton, F. and L'Ecuyer, P. 2005. On the xorshift random number generators. ACM Trans. Model. Comput. Simul. 15, 4, 346--361.
105. Panneton, F., L'Ecuyer, P., and Matsumoto, M. 2006. Improved long-period generators based on linear recurrences modulo 2. ACM Trans. Math. Soft. 32, 1, 1--16.
106. Percus, O. E. and Whitlock, P. A. 1995. Theory and application of Marsaglia's monkey test for pseudorandom number generators. ACM Trans. Model. Comput. Simul. 5, 2, 87--100.
107. Press, W. H. and Teukolsky, S. A. 1992. Numerical Recipes in C. Cambridge University Press, Cambridge, UK.
108. Project, T. G. 2003. R: An Environment for Statistical Computing and Graphics. The Free Software Foundation. Version 1.6.2. http://www.gnu.org/directory/GNU/R.html.
109. Read, T. R. C. and Cressie, N. A. C. 1988. Goodness-of-Fit Statistics for Discrete Multivariate Data. Springer Series in Statistics. Springer-Verlag, Berlin, Germany.
110. Rijmen, V., Bosselærs, A., and Barreto, P. 2000. Optimised ANSI C code for the Rijndael cipher (now AES). Public domain software.
111. Ripley, B. D. 1990. Thoughts on pseudorandom number generators. J. Comput. Appl. Mathem. 31, 153--163.
112. Ripley, B. D. and Venables, W. N. 1994. Modern Applied Statistics with S-Plus. Springer-Verlag, Berlin, Germany.
113. Rukhin, A., Soto, J., Nechvatal, J., Smid, M., Barker, E., Leigh, S., Levenson, M., Vangel, M., Banks, D., Heckert, A., Dray, J., and Vo, S. 2001. A statistical test suite for random and pseudorandom number generators for cryptographic applications. NIST special publication 800-22, National Institute of Standards and Technology (NIST), Gaithersburg, MD. http://csrc.nist.gov/rng/.
114. Rukhin, A. L. 2001. Testing randomness: A suite of statistical procedures. Theo. Probab. Applic. 45, 1, 111--132.
115. Ryabko, B. Y., Monarev, V. A., and Shokin, Y. I. 2005. A new type of attack on block ciphers. Probl. Informa. Transmis. 41, 4, 385--394.
116. Ryabko, B. Y., Stognienko, V. S., and Shokin, Y. I. 2004. A new test for randomness and its application to some cryptographic problems. J. Statist. Plan. Infer. 123, 365--376.
117. SciFace Software. 2004. MuPAD. SciFace Software GmbH & Co.KG, Paderborn, Germany. http://www.mupad.de/home.html.
118. Sinclair, C. D. and Spurr, B. D. 1988. Approximations to the distribution function of the Anderson-Darling test statistic. J. Amer. Statist. Ass. 83, 404, 1190--1191.
119. Stephens, M. A. 1970. Use of the Kolmogorov-Smirnov, Cramér-Von Mises and related statistics without extensive tables. J. Royal Statis. Soc., Series B 33, 1, 115--122.
120. Stephens, M. S. 1986a. Tests based on EDF statistics. In Goodness-of-Fit Techniques, R. B. D'Agostino and M. S. Stephens, Eds. Marcel Dekker, New York, NY.
121. Stephens, M. S. 1986b. Tests for the uniform distribution. In Goodness-of-Fit Techniques, R. B. D'Agostino and M. S. Stephens, Eds. Marcel Dekker, New York, NY, 331--366.
122. Takashima, K. 1996. Last visit time tests for pseudorandom numbers. J. Japan. Soc. Comp. Satist. 9, 1, 1--14.
123. Tezuka, S. 1995. Uniform Random Numbers: Theory and Practice. Kluwer Academic Publishers, Norwell, MA.
124. Tezuka, S., L'Ecuyer, P., and Couture, R. 1994. On the add-with-carry and subtract-with-borrow random number generators. ACM Trans. Model. Comput. Simula. 3, 4, 315--331.
125. Tootill, J. P. R., Robinson, W. D., and Eagle, D. J. 1973. An asymptotically random Tausworthe sequence. J. ACM 20, 469--481.
126. Ugrin-Sparac, G. 1991. Stochastic investigations of pseudo-random number generators. Comput. 46, 53--65.
127. Vattulainen, I., Ala-Nissila, T., and Kankaala, K. 1995. Physical models as tests of randomness. Physic. Rev. E 52, 3, 3205--3213.
128. Wang, M. Z. 1997. Linear complexity profiles and jump complexity. Inform. Proces. Let. 61, 165--168.
129. Wegenkittl, S. 1998. Generalized &phis;-divergence and frequency analysis in Markov chains. Ph.D. thesis, University of Salzburg. http://random.mat.sbg.ac.at/team/.
130. Wegenkittl, S. 2001. Entropy estimators and serial tests for ergodic chains. IEEE Trans. Inform. Theo. 47, 6, 2480--2489.
131. Wegenkittl, S. 2002. A generalized &phis;-divergence for asymptotically multivariate normal models. J. Multivari. Anal. 83, 288--302.
132. Wichmann, B. A. and Hill, I. D. 1982. An efficient and portable pseudo-random number generator. App. Statis. 31, 188--190. See also corrections and remarks in the same journal by Wichmann and Hill, 33 (1984) 123; McLeod 34 (1985) 198--200; Zeisel 35 (1986) 89.
133. Wu, P.-C. 1997. Multiplicative, congruential random number generators with multiplier ± 2^k₁ ± 2^k₁ and modulus 2^p − 1. ACM Trans. Mathem. Softw. 23, 2, 255--265.
134. Ziff, R. M. 1998. Four-tap shift-register-sequence random-number generators. Comput. Physics 12, 4, 385--392.
135. Ziv, J. and Lempel, A. 1978. Compression of individual sequences via variable-rate coding. IEEE Trans. on Inform. Theo. 24, 5, 530--536.

Index Terms

• Mathematics of computing

  • Mathematical software

    • Statistical software

  • Probability and statistics

    • Probabilistic reasoning algorithms

      • Random number generation