A search for good multiple recursive random number generators

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A search for good multiple recursive random number generators

Full text

Pdf (792 KB)

Source

ACM Transactions on Modeling and Computer Simulation (TOMACS) archive
Volume 3 , Issue 2 (April 1993) table of contents

Pages: 87 - 98

Year of Publication: 1993

ISSN:1049-3301

Authors

Pierre L'Ecuyer	Université de Montréal
François Blouin	Université Laval
Raymond Couture	Université Laval

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 13, Downloads (12 Months): 74, Citation Count: 11

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/169702.169698 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	L. Afflerbach , H. Grothe, Calculation of Minkowski-reduced lattice bases, Computing, v.35 n.3-4, p.269-276, 1985 [doi>10.1007/BF02240194]
	2	ALANEN, J. D., AND KNUTH, D.E. 1964. Tables of finite fields. SAJVKHY~ Ind. J. Stat., Series A, 26, 305 328.
	3	Paul Bratley , Bennett L. Fox , Linus E. Schrage, A guide to simulation (2nd ed.), Springer-Verlag New York, Inc., New York, NY, 1987
	4	DIETER, U. 1975. How to calculate shortest vectors m a lattice. Math. Comput. 29, 131, 827 833.
	5	FINCKE, U., AND POHST, M. 1985. Improved methods for calculating vectors of short length in a lattice, including a complexity analysis. Math. Comput. 44, 170, 463 471.
	6	FISHMAN, G. S. 1990. Multiplicative congruential random number generators with modulus 2 ~: An exhaustive analysis for/3 = 32 and a partial analysis for ~ = 48. Math. Comput. 54, 189 (Jan.), 331-344.
	7	George A Fishman , Louis R Moore, III, An exhaustive analysis of multiplicative congruential random number generators with modulus 2³¹-1, SIAM Journal on Scientific and Statistical Computing, v.7 n.1, p.24-45, Jan. 1986 [doi>10.1137/0907002]
	8	GROTHE, H. 1988. Matrixgeneratoren zur erzeugung gleichverteilter pseudozufallsvektoren. Dissertation (thesis), Tech. Hochschule Darmstadt, Germany In German.
	9	GRUBE, A. 1973. Mehrfach rekursiv-erzeugte pseudo-zufallszahlen. Zeitschr~ft fur angewandte Moth. und Mechanik 53, T223-T225 In German.
	10	Donald E. Knuth, The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1997
	11	Pierre L'Ecuyer, Random numbers for simulation, Communications of the ACM, v.33 n.10, p.85-97, Oct. 1990 [doi>10.1145/84537.84555]
	12	P. L'Ecuyer, Efficient and portable combined random number generators, Communications of the ACM, v.31 n.6, p.742-751, June 1988 [doi>10.1145/62959.62969]
	13	Pierre L'Ecuer , François Blouin, Linear congruential generators of order K>1, Proceedings of the 20th conference on Winter simulation, p.432-439, December 12-14, 1988, San Diego, California, United States [doi>10.1145/318123.318229]
	14	Pierre L'Ecuyer , Serge Côté, Implementing a random number package with splitting facilities, ACM Transactions on Mathematical Software (TOMS), v.17 n.1, p.98-111, March 1991 [doi>10.1145/103147.103158]
	15	Rudolf Lidl , Harald Niederreiter, Introduction to finite fields and their applications, Cambridge University Press, New York, NY, 1986
	16	MONTGOMERY, P.L. 1987. Speeding the Pollard and elliptic curve methods of factorization. Math Comput. 48, 177, 243-264.
	17	MORAIN, F. 1988. Implementation of the Atkin-Goldwasser-Kfiian primality testing algorithm. Rapport de recherche 911, INRIA, Rocquencourt, France.
	18	Harald Niederreiter, Random number generation and quasi-Monte Carlo methods, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1992
	19	Harald Niederreiter, Recent trends in random number and random vector generation, Annals of Operations Research, v.31 n.1-4, p.323-346, June 1991 [doi>10.1007/BF02204856]
	20	NIEDERREITER, H. 1988. The serial test for digital k-step pseudorandom numbers. Math. J. Okayama Unw. 30, 93 119.
	21	NIEDERREiTER, $. 1986. A pseudorandom vector generator based on finite field arithmetic. Math. Japontca 31, 5, 759 774.
	22	NIEDERREITER, H. 1982 Statistical tests for Tausworthe pseudorandom numbers. In Probabd- ~ty and Statistical I, ference. Reidel, Dordrecht, Boston, 265-274.
	23	S. K. Park , K. W. Miller, Random number generators: good ones are hard to find, Communications of the ACM, v.31 n.10, p.1192-1201, Oct. 1988 [doi>10.1145/63039.63042]
	24	Brian D. Ripley, Stochastic simulation, John Wiley & Sons, Inc., New York, NY, 1987

CITED BY 11

	Karl Entacher, Bad subsequences of well-known linear congruential pseudorandom number generators, ACM Transactions on Modeling and Computer Simulation (TOMACS), v.8 n.1, p.61-70, Jan. 1998
	Lih-Yuan Deng , Hongquan Xu, A system of high-dimensional, efficient, long-cycle and portable uniform random number generators, ACM Transactions on Modeling and Computer Simulation (TOMACS), v.13 n.4, p.299-309, October 2003
	Pierre L'Ecuyer , Renée Touzin, Fast combined multiple recursive generators with multipliers of the form a = ±2^q ±2^r, Proceedings of the 32nd conference on Winter simulation, December 10-13, 2000, Orlando, Florida
	Lih-Yuan Deng, Efficient and portable multiple recursive generators of large order, ACM Transactions on Modeling and Computer Simulation (TOMACS), v.15 n.1, p.1-13, January 2005
	Hui-Chin Tang, An exhaustive analysis of two-term multiple recursive random number generators with efficient multipliers, Journal of Computational and Applied Mathematics, v.192 n.2, p.411-416, 1 August 2006
	Pierre L'Ecuyer , Renée Touzin, On the Deng-Lin random number generators and related methods, Statistics and Computing, v.14 n.1, p.5-9, January 2004
	Tim Paulden , David K. Smith, Some novel locality results for the blob code spanning tree representation, Proceedings of the 9th annual conference on Genetic and evolutionary computation, July 07-11, 2007, London, England
	Makoto Matsumoto , Isaku Wada , Ai Kuramoto , Hyo Ashihara, Common defects in initialization of pseudorandom number generators, ACM Transactions on Modeling and Computer Simulation (TOMACS), v.17 n.4, p.15-es, September 2007
	Pierre L'Ecuyer , Richard Simard, TestU01: A C library for empirical testing of random number generators, ACM Transactions on Mathematical Software (TOMS), v.33 n.4, p.22-es, August 2007
	Roy S. Wikramaratna, The additive congruential random number generator-A special case of a multiple recursive generator, Journal of Computational and Applied Mathematics, v.216 n.2, p.371-387, July, 2008
	Lih-Yuan Deng , Huajiang Li , Jyh-Jen Horng Shiau, Scalable parallel multiple recursive generators of large order, Parallel Computing, v.35 n.1, p.29-37, January, 2009