REFERENCES

• Anderson, S. L. 1990. Random number generators on vector supercomputers and other advanced architectures. SIAM Rev. 32:221-251.
• Chou, W.-S. 1994. On inversive maximal period polynomials over finite fields. Algebra Engrg. Comm. Comput. to appear.
• Coveyou, R. R. and R. D. MacPherson. 1967. Fourier analysis of uniform random number generators. Journal of the ACM 14:100-119.
• De Matteis, A. and S. Pagnutti. 1990. Long-range correlations in linear and non-linear random number generators. Parallel Computing 14: 207-210.
• Devroye, L. 1986. Non-Uniform Random Variate Generation. Springer-Verlag: New York.
• Eddy, W. F. 1990. Random number generators for parallel processors. J. Comput. Appl. Math. 31:63-71.
• Eichenauer, J. and J. Lehn. 1986. A non-linear congruential pseudo random number generator. Statist. Papers 27:315-326.
• Eichenauer-Hermann, J. 1991. Inversive congruential pseudorandom numbers avoid the planes. Math. Comp. 56:297-301.
• Eichenauer-Herrmann, J. 1993a. Statistical independence of a new class of inversive congruential pseudorandom numbers. Math. Comp. 60:375-384.
• Eichenauer-Herrmann, J. 1993b. Explicit inversive congruential pseudorandom numbers: The compound approach. Computing 51:175-182.
• Eichenauer-Herrmann, J. 1994a. Compound nonlinear congruential pseudorandom number s. Monatsh. Math 117:213-222.
• Eichenauer-Herrmann, J. 1994b. Improved lower bounds for the discrepancy of inversive congruential pseudorandom numbers. Math. Comp 62:783-786.
• Eichenauer-Herrmann, J. and F. Emmerich. 1994. Compound inversive congruential numbers: an average-case analysis. Math. Comp. To appear.
• Eichenauer-Herrmann, J. and F. Emmerich. 1995. A review of compound methods for pseudorandom number generation. In Proceedings of the 1st Salzburg Minisymposium on Pseudorandom Number Generation and Quasi-Monte Carlo Methods, Salzburg, Nov. 18, 1994, ed. Hellekalek, P., G. Larcher, and P. Zinterhof, 5-15. Vienna: ACPC - Austrian Center for Parallel Computation, Technical Report Series, University of Vienna.
• Eichenauer-Herrmann, J. and H. Niederreiter. 1994. Bounds for exponential sums and their applications to pseudorandom numbers. Acta Arith. 67:269-281.
• Entacher, K. 1995a. Selected random number generators in the run test. Preprint, Dept. of Mathematics, University of Salzburg, Austria.
• Entacher, K. 1995b. Selected random number generators in the run test II: subsequence behavior. Article in preparation, Dept. of Mathematics, University of Salzburg, Austria.
• Ferrenberg, A. M. and D. P. Landau. 1992. Monte Carlo simulations: hidden errors from ``good'' random number generators. Phys. Rev. Lett 69:3382-3384.
• Fishman, G. S. and L. S. Moore. 1982. A statistical evaluation of multiplicative congruential random number generators with modulus J. Amer. Statist. Assoc. 77:129-136.
• Fishman, G. S. and L. S. Moore III. 1986. An exhaustive analysis of multiplicative congruential random number generators with modulus . SIAM J. Sci. and Statist. Comput. 7:24-45. Erratum, ibid. 7:1058.
• Flahive, M. and H. Niederreiter. 1992. In Finite Fields, Coding Theory, and Advances in Communications and Computing, ed. G. L. Mullen and P. J.-S. Shiue, 75-80. New York: Dekker.
• Knuth, D.E. 1981. The Art of Computer Programming, Vol. 2. Addison-Wesley, Reading, Mass.
• L'Ecuyer, P. 1992. Testing uniform random number generators. In Proceedings of the 1992 Winter Simulation Conference (Arlington, Va., 1992), ed. J.J. Swain et al., 305-313. IEEE Press.
• L'Ecuyer, P. 1994. Uniform random number generation. Annals of Operations Research 53: 77-120.
• Leeb, H. 1994. Leeb, H., PLAB- a system for testing random numbers. In Proceedings of the International Workshop Parallel Numerics '94, Smolenice, Sept. 19-21, ed. Vajtersic, M. and P. Zinterhof, 89-99. Bratislava: Slovak Academy of Sciences, Institute for Informatics.
• Leeb, H. 1995. On the digit test. In Proceedings of the 1st Salzburg Minisymposium on Pseudorandom Number Generation and Quasi-Monte Carlo Methods, Salzburg, Nov 18, 1994, ed. Hellekalek, P., G. Larcher, and P. Zinterhof, 109-121. Vienna: ACPC - Austrian Center for Parallel Computation, Technical Report Series, University of Vienna.
• Marsaglia, G. 1968. Random numbers fall mainly in the planes. Proceedings of the National Academy of Sciences of the United States of America 60:25-28.
• Marsaglia, G. 1985. A Current View of Random Number Generation. In Computer Science and Statistics, Proceedings of the Sixteenth Symposium on the Interface, Atlanta, march 1984., ed. Brillard, L., 3-10. Elsevier Science Publ. (North-Holland).
• Niederreiter, H. 1992. Random number generation and quasi-Monte Carlo methods. Philadelphia: SIAM.
• Niederreiter, H. 1994. On a new class of pseudorandom numbers for simulation methods. J. Comp. Appl. Math. 56:159-167.
• Niederreiter, H. 1995a. 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. Berlin: Springer-Verlag, to appear.
• Niederreiter, H. 1995b. Some linear and nonlinear methods for pseudorandom number generation. In this volume.
• Park, S. K. and K. W. Miller. 1988. Random number generators: good ones are hard to find. Comm. ACM 31: 1192-1201.
• Ripley, B. D. 1987. Stochastic Simulation. New York: John Wiley & Sons.
• Stadlober, E. and R. Kremer. 1992. Sampling from discrete and continuous distributions with C-Rand. In Simulation and Optimization, ed. G. Pflug and U. Dieter. Lecture Notes in Economics and Math. Systems, Vol. 374, 154-162. Berlin: Springer-Verlag.
• Stadlober, E. and F. Niederl. 1994. C-Rand: A package for generating nonuniform random variates. In: Compstat '94, Software Descriptions, 63-64.
• Wegenkittl, S. 1995. Empirical testing of pseudorandom number generator s. Master's thesis in preparation, Dept. of Mathematics, University of Salzburg, Austria.

Overview * Team * Generators * Tests * News * Literature * Links