References

1

Aiello, W., Rajagopalan, S., and Venkatesan, R. (1998).
Design of practical and provably good random number generators.
Journal of Algorithms, 29(2):358-389.

2

Blum, L., Blum, M., and Schub, M. (1986).
A simple unpredictable pseudo-random number generator.
SIAM Journal on Computing, 15(2):364-383.

3

Bratley, P., Fox, B. L., and Schrage, L. E. (1987).
A Guide to Simulation.
Springer-Verlag, New York, second edition.

4

Brown, M. and Solomon, H. (1979).
On combining pseudorandom number generators.
Annals of Statistics, 1:691-695.

5

Chen, H. C. and Asau, Y. (1974).
On generating random variates from an empirical distribution.
AIEE Transactions, 6:163-166.

6

Cheng, R. C. H. (1998).
Random variate generation.
In Banks, J., editor, Handbook of Simulation, pages 139-172. Wiley.
Chap. 5.

7

Collings, B. J. (1987).
Compound random number generators.
Journal of the American Statistical Association, 82(398):525-527.

8

Conway, J. H. and Sloane, N. J. A. (1999).
Sphere Packings, Lattices and Groups.
Grundlehren der Mathematischen Wissenschaften 290. Springer-Verlag, New York, 3rd edition.

9

Couture, R. and L'Ecuyer, P. (1994).
On the lattice structure of certain linear congruential sequences related to AWC/SWB generators.
Mathematics of Computation, 62(206):798-808.

10

Couture, R. and L'Ecuyer, P. (1996).
Orbits and lattices for linear random number generators with composite moduli.
Mathematics of Computation, 65(213):189-201.

11

Couture, R. and L'Ecuyer, P. (1997).
Distribution properties of multiply-with-carry random number generators.
Mathematics of Computation, 66(218):591-607.

12

Couture, R. and L'Ecuyer, P. (2000).
Lattice computations for random numbers.
Mathematics of Computation, 69(230):757-765.

13

Deng, L.-Y. and George, E. O. (1990).
Generation of uniform variates from several nearly uniformly distributed variables.
Communications in Statistics, B19(1):145-154.

14

Deng, L.-Y. and Lin, D. K. J. (2000).
Random number generation for the new century.
The American Statistician, 54(2):145-150.

15

Deng, L.-Y. and Xu, H. (2003).
A system of high-dimensional, efficient, long-cycle and portable uniform random number generators.
ACM Transactions on Modeling and Computer Simulation, 13(4):299-309.

16

Devroye, L. (1986).
Non-Uniform Random Variate Generation.
Springer-Verlag, New York.

17

Eichenauer-Herrmann, J. (1995).
Pseudorandom number generation by nonlinear methods.
International Statistical Reviews, 63:247-255.

18

Eichenauer-Herrmann, J., Herrmann, E., and Wegenkittl, S. (1997).
A survey of quadratic and inversive congruential pseudorandom numbers.
In Hellekalek, P., Larcher, G., Niederreiter, H., and Zinterhof, P., editors, Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing, volume 127 of Lecture Notes in Statistics, pages 66-97, New York. Springer.

19

Evans, M. and Swartz, T. (2000).
Approximating Integrals via Monte Carlo and Deterministic Methods.
Oxford University Press, Oxford, UK.

20

Fincke, U. and Pohst, M. (1985).
Improved methods for calculating vectors of short length in a lattice, including a complexity analysis.
Mathematics of Computation, 44:463-471.

21

Fishman, G. S. (1996).
Monte Carlo: Concepts, Algorithms, and Applications.
Springer Series in Operations Research. Springer-Verlag, New York.

22

Fushimi, M. (1983).
Increasing the orders of equidistribution of the leading bits of the Tausworthe sequence.
Information Processing Letters, 16:189-192.

23

Gentle, J. E. (2003).
Random Number Generation and Monte Carlo Methods.
Springer, New York, second edition.

24

Goresky, M. and Klapper, A. (2003).
Efficient multiply-with-carry random number generators with maximal period.
ACM Transactions on Modeling and Computer Simulation, 13(4):310-321.

25

Hellekalek, P. and Larcher, G., editors (1998).
Random and Quasi-Random Point Sets, volume 138 of Lecture Notes in Statistics.
Springer, New York.

26

Hellekalek, P. and Wegenkittl, S. (2003).
Empirical evidence concerning AES.
ACM Transactions on Modeling and Computer Simulation, 13(4):322-333.

27

Hörmann, W. and Leydold, J. (2000).
Automatic random variate generation for simulation input.
In Joines, J. A., Barton, R. R., Kang, K., and Fishwick, P. A., editors, Proceedings of the 2000 Winter Simulation Conference, pages 675-682, Pistacaway, NJ. IEEE Press.

28

Hörmann, W. and Leydold, J. (2003).
Continuous random variate generation by fast numerical inversion.
ACM Transactions on Modeling and Computer Simulation, 13(4):347-362.

29

Hörmann, W., Leydold, J., and Derflinger, G. (2004).
Automatic Nonuniform Random Variate Generation.
Springer-Verlag, Berlin.

30

Kinderman, A. J. and Monahan, J. F. (1977).
Computer generation of random variables using the ratio of uniform deviates.
ACM Transactions on Mathematical Software, 3:257-260.

31

Knuth, D. E. (1998).
The Art of Computer Programming, Volume 2: Seminumerical Algorithms.
Addison-Wesley, Reading, Mass., third edition.

32

Kronmal, R. A. and Peterson, A. V. (1984).
An acceptance-complement analogue of the mixture-plus-acceptance-rejection method for generating random variables.
ACM Transactions on Mathematical Software, 10:271-281.

33

Lagarias, J. C. (1993).
Pseudorandom numbers.
Statistical Science, 8(1):31-39.

34

Law, A. M. and Kelton, W. D. (2000).
Simulation Modeling and Analysis.
McGraw-Hill, New York, third edition.

35

L'Ecuyer, P. (1990).
Random numbers for simulation.
Communications of the ACM, 33(10):85-97.

36

L'Ecuyer, P. (1994).
Uniform random number generation.
Annals of Operations Research, 53:77-120.

37

L'Ecuyer, P. (1996a).
Combined multiple recursive random number generators.
Operations Research, 44(5):816-822.

38

L'Ecuyer, P. (1996b).
Maximally equidistributed combined Tausworthe generators.
Mathematics of Computation, 65(213):203-213.

39

L'Ecuyer, P. (1997).
Bad lattice structures for vectors of non-successive values produced by some linear recurrences.
INFORMS Journal on Computing, 9(1):57-60.

40

L'Ecuyer, P. (1998).
Random number generation.
In Banks, J., editor, Handbook of Simulation, pages 93-137. Wiley.
Chap. 4.

41

L'Ecuyer, P. (1999a).
Good parameters and implementations for combined multiple recursive random number generators.
Operations Research, 47(1):159-164.

42

L'Ecuyer, P. (1999b).
Tables of linear congruential generators of different sizes and good lattice structure.
Mathematics of Computation, 68(225):249-260.

43

L'Ecuyer, P. (1999c).
Tables of maximally equidistributed combined LFSR generators.
Mathematics of Computation, 68(225):261-269.

44

L'Ecuyer, P. (2001).
Software for uniform random number generation: Distinguishing the good and the bad.
In Proceedings of the 2001 Winter Simulation Conference, pages 95-105, Pistacaway, NJ. IEEE Press.

45

L'Ecuyer, P. (2004).
Polynomial integration lattices.
In Niederreiter, H., editor, Monte Carlo and Quasi-Monte Carlo Methods 2002, pages 73-98, Berlin. Springer-Verlag.

46

L'Ecuyer, P. and Andres, T. H. (1997).
A random number generator based on the combination of four LCGs.
Mathematics and Computers in Simulation, 44:99-107.

47

L'Ecuyer, P., Blouin, F., and Couture, R. (1993).
A search for good multiple recursive random number generators.
ACM Transactions on Modeling and Computer Simulation, 3(2):87-98.

48

L'Ecuyer, P. and Côté, S. (1991).
Implementing a random number package with splitting facilities.
ACM Transactions on Mathematical Software, 17(1):98-111.

49

L'Ecuyer, P. and Couture, R. (1997).
An implementation of the lattice and spectral tests for multiple recursive linear random number generators.
INFORMS Journal on Computing, 9(2):206-217.

50

L'Ecuyer, P. and Granger-Piché, J. (2003).
Combined generators with components from different families.
Mathematics and Computers in Simulation, 62:395-404.

51

L'Ecuyer, P. and Hellekalek, P. (1998).
Random number generators: Selection criteria and testing.
In Hellekalek, P. and Larcher, G., editors, Random and Quasi-Random Point Sets, volume 138 of Lecture Notes in Statistics, pages 223-265. Springer, New York.

52

L'Ecuyer, P. and Lemieux, C. (2000).
Variance reduction via lattice rules.
Management Science, 46(9):1214-1235.

53

L'Ecuyer, P. and Lemieux, C. (2002).
Recent advances in randomized quasi-Monte Carlo methods.
In Dror, M., L'Ecuyer, P., and Szidarovszki, F., editors, Modeling Uncertainty: An Examination of Stochastic Theory, Methods, and Applications, pages 419-474. Kluwer Academic Publishers, Boston.

54

L'Ecuyer, P. and Panneton, F. (2002).
Construction of equidistributed generators based on linear recurrences modulo 2.
In Fang, K.-T., Hickernell, F. J., and Niederreiter, H., editors, Monte Carlo and Quasi-Monte Carlo Methods 2000, pages 318-330. Springer-Verlag, Berlin.

55

L'Ecuyer, P. and Proulx, R. (1989).
About polynomial-time ''unpredictable'' generators.
In Proceedings of the 1989 Winter Simulation Conference, pages 467-476. IEEE Press.

56

L'Ecuyer, P. and Simard, R. (1999).
Beware of linear congruential generators with multipliers of the form $a = \pm 2^q \pm 2^r$.
ACM Transactions on Mathematical Software, 25(3):367-374.

57

L'Ecuyer, P. and Simard, R. (2001).
On the performance of birthday spacings tests for certain families of random number generators.
Mathematics and Computers in Simulation, 55(1-3):131-137.

58

L'Ecuyer, P. and Simard, R. (2002).
TestU01: A Software Library in ANSI C for Empirical Testing of Random Number Generators.
Software user's guide.

59

L'Ecuyer, P., Simard, R., Chen, E. J., and Kelton, W. D. (2002a).
An object-oriented random-number package with many long streams and substreams.
Operations Research, 50(6):1073-1075.

60

L'Ecuyer, P., Simard, R., and Wegenkittl, S. (2002b).
Sparse serial tests of uniformity for random number generators.
SIAM Journal on Scientific Computing, 24(2):652-668.

61

L'Ecuyer, P. and Tezuka, S. (1991).
Structural properties for two classes of combined random number generators.
Mathematics of Computation, 57(196):735-746.

62

L'Ecuyer, P. and Touzin, R. (2000).
Fast combined multiple recursive generators with multipliers of the form $a = \pm 2^q \pm 2^r$.
In Joines, J. A., Barton, R. R., Kang, K., and Fishwick, P. A., editors, Proceedings of the 2000 Winter Simulation Conference, pages 683-689, Pistacaway, NJ. IEEE Press.

63

L'Ecuyer, P. and Touzin, R. (2004).
On the Deng-Lin random number generators and related methods.
Statistics and Computing, 14:5-9.

64

Leeb, H. (1995).
Random numbers for computer simulation.
Master's thesis, University of Salzburg.

65

Lemieux, C. and L'Ecuyer, P. (2003).
Randomized polynomial lattice rules for multivariate integration and simulation.
SIAM Journal on Scientific Computing, 24(5):1768-1789.

66

Leydold, J. (2000).
Automatic sampling with the ratio-of-uniform method.
ACM Transactions on Mathematical Software, 26(1):78-98.

67

Leydold, J. and Hörmann, W. (2002).
UNURAN--A Library for Universal Non-Uniform Random Number Generators.
Available at http://statistik.wu-wien.ac.at/unuran.

68

Leydold, J., Janka, E., and Hörmann, W. (2002).
Variants of transformed density rejection and correlation induction.
In Fang, K.-T., Hickernell, F. J., and Niederreiter, H., editors, Monte Carlo and Quasi-Monte Carlo Methods 2000, pages 345-356, Berlin. Springer-Verlag.

69

Luby, M. (1996).
Pseudorandomness and Cryptographic Applications.
Princeton University Press, Princeton.

70

Lüscher, M. (1994).
A portable high-quality random number generator for lattice field theory simulations.
Computer Physics Communications, 79:100-110.

71

Marsaglia, G. (1985).
A current view of random number generators.
In Computer Science and Statistics, Sixteenth Symposium on the Interface, pages 3-10, North-Holland, Amsterdam. Elsevier Science Publishers.

72

Marsaglia, G. (1996).
The Marsaglia random number CDROM including the DIEHARD battery of tests of randomness.
See http://stat.fsu.edu/pub/diehard.

73

Marsaglia, G. and Zaman, A. (1991).
A new class of random number generators.
The Annals of Applied Probability, 1:462-480.

74

Marsaglia, G., Zaman, A., and Marsaglia, J. C. W. (1994).
Rapid evaluation of the inverse normal distribution function.
Statistic and Probability Letters, 19:259-266.

75

Matsumoto, M. and Kurita, Y. (1992).
Twisted GFSR generators.
ACM Transactions on Modeling and Computer Simulation, 2(3):179-194.

76

Matsumoto, M. and Kurita, Y. (1994).
Twisted GFSR generators II.
ACM Transactions on Modeling and Computer Simulation, 4(3):254-266.

77

Matsumoto, M. and Kurita, Y. (1996).
Strong deviations from randomness in $m$-sequences based on trinomials.
ACM Transactions on Modeling and Computer Simulation, 6(2):99-106.

78

Matsumoto, M. and Nishimura, T. (1998).
Mersenne twister: A 623-dimensionally equidistributed uniform pseudo-random number generator.
ACM Transactions on Modeling and Computer Simulation, 8(1):3-30.

79

Nelson, B. L. and Yamnitsky, M. (1998).
Input modeling tools for complex problems.
In Proceedings of the 1998 Winter Simulation Conference, pages 105-112, Piscataway, NJ. IEEE Press.

80

Niederreiter, H. (1992).
Random Number Generation and Quasi-Monte Carlo Methods, volume 63 of SIAM CBMS-NSF Regional Conference Series in Applied Mathematics.
SIAM, Philadelphia.

81

Niederreiter, H. (1995).
The multiple-recursive matrix method for pseudorandom number generation.
Finite Fields and their Applications, 1:3-30.

82

Niederreiter, H. and Shparlinski, I. E. (2002).
Recent advances in the theory of nonlinear pseudorandom number generators.
In Fang, K.-T., Hickernell, F. J., and Niederreiter, H., editors, Monte Carlo and Quasi-Monte Carlo Methods 2000, pages 86-102, Berlin. Springer-Verlag.

83

Nishimura, T. (2000).
Tables of 64-bit Mersenne twisters.
ACM Transactions on Modeling and Computer Simulation, 10(4):348-357.

84

Panneton, F. and L'Ecuyer, P. (2004).
Random number generators based on linear recurrences in $F_{2^w}$.
In Niederreiter, H., editor, Monte Carlo and Quasi-Monte Carlo Methods 2002, pages 367-378, Berlin. Springer-Verlag.

85

Read, T. R. C. and Cressie, N. A. C. (1988).
Goodness-of-Fit Statistics for Discrete Multivariate Data.
Springer Series in Statistics. Springer-Verlag, New York.

86

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, Maryland, USA.
See http://csrc.nist.gov/rng/.

87

Tausworthe, R. C. (1965).
Random numbers generated by linear recurrence modulo two.
Mathematics of Computation, 19:201-209.

88

Tezuka, S. (1995).
Uniform Random Numbers: Theory and Practice.
Kluwer Academic Publishers, Norwell, Mass.

89

Tezuka, S. and L'Ecuyer, P. (1991).
Efficient and portable combined Tausworthe random number generators.
ACM Transactions on Modeling and Computer Simulation, 1(2):99-112.

90

Tezuka, S., L'Ecuyer, P., and Couture, R. (1994).
On the add-with-carry and subtract-with-borrow random number generators.
ACM Transactions of Modeling and Computer Simulation, 3(4):315-331.

91

Tootill, J. P. R., Robinson, W. D., and Eagle, D. J. (1973).
An asymptotically random Tausworthe sequence.
Journal of the ACM, 20:469-481.

92

Vattulainen, I., Ala-Nissila, T., and Kankaala, K. (1995).
Physical models as tests of randomness.
Physical Review E, 52(3):3205-3213.

93

von Neumann, J. (1951).
Various techniques used in connection with random digits.
In Householder, A. S. et al., editors, The Monte Carlo Method, number 12 in National Bureau of Standards Applied Mathematics Series, pages 36-38.

94

Wagner, M. A. F. and Wilson, J. R. (1996).
Using univariate Bézier distributions to model simulation input processes.
IIE Transactions, 28:699-711.

95

Walker, A. J. (1974).
New fast method for generating discrete random numbers with arbitrary frequency distributions.
Electronic Letters, 10:127-128.

96

Walker, A. J. (1977).
An efficient method for generating discrete random variables with general distributions.
ACM Transactions on Mathematical Software, 3:253-256.

97

Wang, D. and Compagner, A. (1993).
On the use of reducible polynomials as random number generators.
Mathematics of Computation, 60:363-374.

98

Wegenkittl, S. and Matsumoto, M. (1999).
Getting rid of correlations among pseudorandom numbers: Discarding versus tempering.
ACM Transactions on Modeling and Computer Simulation, 9(3):282-294.

99

Wu, P.-C. (1997).
Multiplicative, congruential random number generators with multiplier $\pm 2^{k_1} \pm 2^{k_2}$ and modulus $2^p-1$.
ACM Transactions on Mathematical Software, 23(2):255-265.