{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:26:43Z","timestamp":1759134403904},"reference-count":28,"publisher":"Elsevier BV","issue":"10","license":[{"start":{"date-parts":[[1997,10,1]],"date-time":"1997-10-01T00:00:00Z","timestamp":875664000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[1997,10]]},"DOI":"10.1016\/s0305-0548(97)00017-8","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:18:15Z","timestamp":1049501895000},"page":"899-905","source":"Crossref","is-referenced-by-count":15,"title":["Systematic searches for good multiple recursive random number generators"],"prefix":"10.1016","volume":"24","author":[{"given":"Chiang","family":"Kao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.C.","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(97)00017-8_BIB1","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1137\/1032044","article-title":"Random number generators on vector supercomputers and other advanced architectures","volume":"32","author":"Anderson","year":"1990","journal-title":"SIAM Review"},{"key":"10.1016\/S0305-0548(97)00017-8_BIB2","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/0010-4655(90)90032-V","article-title":"A review of pseudorandom number generators","volume":"60","author":"James","year":"1990","journal-title":"Computer Physics Communications"},{"key":"10.1016\/S0305-0548(97)00017-8_BIB3_1","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0010-4655(93)90168-C","article-title":"Pseudorandom number generators for personal computers I and II","volume":"75","author":"Hamilton","year":"1993","journal-title":"Computer Physics Communications"},{"key":"10.1016\/S0305-0548(97)00017-8_BIB3_2","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1016\/0010-4655(93)90152-3","article-title":"Pseudorandom number generators for personal computers I and II","volume":"78","author":"Hamilton","year":"1993","journal-title":"Computer Physics Communications"},{"key":"10.1016\/S0305-0548(97)00017-8_BIB4","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0377-0427(90)90346-2","article-title":"Thoughts on pseudorandom number generators","volume":"31","author":"Ripley","year":"1990","journal-title":"Journal of Computers and Applied Mathematics"},{"key":"10.1016\/S0305-0548(97)00017-8_BIB5","first-page":"331","article-title":"Multiple congruential random number generators with modulus 2\u03b2: An exhaustive analysis for \u03b2=32 and a partial analysis for \u03b2=48","volume":"54","author":"Fishman","year":"1990","journal-title":"Mathematics of Computation"},{"key":"10.1016\/S0305-0548(97)00017-8_BIB6","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1137\/0907002","article-title":"An exhaustive analysis of multiplicative congruential random number generators with modulus 231 \u2212 1","volume":"7","author":"Fishman","year":"1986","journal-title":"SIAM Journal of Science and Statistics in Computing"},{"key":"10.1016\/S0305-0548(97)00017-8_BIB7","doi-asserted-by":"crossref","first-page":"742","DOI":"10.1145\/62959.62969","article-title":"Efficient and portable combined random number generators","volume":"31","author":"L'Ecuyer","year":"1988","journal-title":"Communications of the ACM"},{"key":"10.1016\/S0305-0548(97)00017-8_BIB8","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1145\/103147.103158","article-title":"Implementing a random number package with splitting facilities","volume":"17","author":"L'Ecuyer","year":"1991","journal-title":"ACM Transactions on Mathematical Software"},{"key":"10.1016\/S0305-0548(97)00017-8_BIB9","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1080\/00949659208811409","article-title":"A limit on the usable length of a pseudorandom sequence","volume":"42","author":"MacLaren","year":"1992","journal-title":"Journal of Statistical Computation and Simulation"},{"key":"10.1016\/S0305-0548(97)00017-8_BIB10","author":"Knuth","year":"1981"},{"key":"10.1016\/S0305-0548(97)00017-8_BIB11","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1145\/169702.169698","article-title":"A search for good multiple recursive random number generators","volume":"3","author":"L'Ecuyer","year":"1993","journal-title":"ACM Transactions on Modeling and Computer Simulations"},{"key":"10.1016\/S0305-0548(97)00017-8_BIB12","first-page":"513","article-title":"Multiplicative congruential random number generator of order two with modulus 32749","volume":"6","author":"Kao","year":"1996","journal-title":"International Journal of Computer Simulation"},{"key":"10.1016\/S0305-0548(97)00017-8_BIB13","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1145\/84537.84555","article-title":"Random numbers for simulation","volume":"33","author":"L'Ecuyer","year":"1990","journal-title":"Communications of the ACM"},{"key":"10.1016\/S0305-0548(97)00017-8_BIB14","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1214\/aos\/1176344690","article-title":"On combining pseudorandom number generators","volume":"3","author":"Brown","year":"1979","journal-title":"Annals of Statistics"},{"key":"10.1016\/S0305-0548(97)00017-8_BIB15","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1080\/03610919008812849","article-title":"Generation of uniform variates from several nearly uniformly distributed variables","volume":"B19","author":"Deng","year":"1990","journal-title":"Communications in Statistics"},{"key":"10.1016\/S0305-0548(97)00017-8_BIB16","series-title":"Proceedings of Winter Simulation Conference","first-page":"1043","article-title":"Combining random number generators","author":"Deng","year":"1991"},{"key":"10.1016\/S0305-0548(97)00017-8_BIB17","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1145\/321371.321379","article-title":"Fourier analysis of uniform random number generators","volume":"14","author":"Coveyou","year":"1967","journal-title":"Journal of the ACM"},{"key":"10.1016\/S0305-0548(97)00017-8_BIB18","first-page":"25","article-title":"Random numbers fall mainly in the planes","volume":"61","author":"Marsaglia","year":"1968"},{"key":"10.1016\/S0305-0548(97)00017-8_BIB19","series-title":"An Introduction to the Geometry of Numbers","author":"Cassels","year":"1959"},{"key":"10.1016\/S0305-0548(97)00017-8_BIB20","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0898-1221(97)00012-6","article-title":"Upper bounds in spectral test for multiple recursive random number generators with missing terms","volume":"33","author":"Kao","year":"1997","journal-title":"Computers and Mathematical Applications"},{"key":"10.1016\/S0305-0548(97)00017-8_BIB21","doi-asserted-by":"crossref","unstructured":"Kao, C. and Wong, J. Y., Random number generators with long period and sound statistical properties. Computers and Mathematical Applications, in press.","DOI":"10.1016\/S0898-1221(98)00133-3"},{"key":"10.1016\/S0305-0548(97)00017-8_BIB22","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1177\/003754978304100401","article-title":"Implementing a portable FORTRAN uniform (0 1) generator","volume":"41","author":"Marse","year":"1983","journal-title":"Simulation"},{"key":"10.1016\/S0305-0548(97)00017-8_BIB23","doi-asserted-by":"crossref","first-page":"188","DOI":"10.2307\/2347988","article-title":"An efficient and portable pseudorandom number generator","volume":"31","author":"Wichmann","year":"1983","journal-title":"Applied Statistics"},{"key":"10.1016\/S0305-0548(97)00017-8_BIB24","doi-asserted-by":"crossref","first-page":"1089","DOI":"10.1016\/0305-0548(94)90039-6","article-title":"Decomposition with simulated division for efficiently generating random numbers","volume":"21","author":"Kao","year":"1994","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(97)00017-8_BIB25","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0377-0427(90)90342-W","article-title":"Computer implementation of random number generators","volume":"31","author":"Gentle","year":"1990","journal-title":"Journal of Computational and Applied Mathematics"},{"key":"10.1016\/S0305-0548(97)00017-8_BIB26","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0377-0427(92)90212-G","article-title":"Some comments on computer implementation of random number generators","volume":"39","author":"Sezgin","year":"1992","journal-title":"Journal of Computational and Applied Mathematics"},{"key":"10.1016\/S0305-0548(97)00017-8_BIB27","doi-asserted-by":"crossref","first-page":"1192","DOI":"10.1145\/63039.63042","article-title":"Random number generators: good ones are hard to find","volume":"31","author":"Park","year":"1988","journal-title":"Communications of the ACM"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054897000178?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054897000178?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T01:21:29Z","timestamp":1555204889000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054897000178"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,10]]},"references-count":28,"journal-issue":{"issue":"10","published-print":{"date-parts":[[1997,10]]}},"alternative-id":["S0305054897000178"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(97)00017-8","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1997,10]]}}}