메뉴 건너뛰기




Volumn 33, Issue 4, 1997, Pages 119-125

Upper bounds in spectral test for multiple recursive random number generators with missing terms

Author keywords

Integer program; Random number generator; Spectral test

Indexed keywords

BOUNDARY CONDITIONS; POLYNOMIALS; SPECTRUM ANALYSIS;

EID: 0031069531     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0898-1221(97)00012-6     Document Type: Article
Times cited : (14)

References (14)
  • 3
    • 0001818037 scopus 로고
    • Symmetry property of multiplicative congruential random number generator in chi-square test
    • C. Kao and H.C. Tang, Symmetry property of multiplicative congruential random number generator in chi-square test, Intern. J. Computer Math. 55, 113-118 (1995).
    • (1995) Intern. J. Computer Math. , vol.55 , pp. 113-118
    • Kao, C.1    Tang, H.C.2
  • 5
    • 0001859773 scopus 로고
    • Fourier analysis of uniform random number generators
    • R.R. Coveyou and R.D. MacPherson, Fourier analysis of uniform random number generators, J. of the ACM 14, 100-119 (1967).
    • (1967) J. of the ACM , vol.14 , pp. 100-119
    • Coveyou, R.R.1    MacPherson, R.D.2
  • 6
    • 0002773602 scopus 로고
    • Random numbers fall mainly in the planes
    • G. Marsaglia, Random numbers fall mainly in the planes, Proc. of the Nat. Acad. Sci. 60, 25-28 (1968).
    • (1968) Proc. of the Nat. Acad. Sci. , vol.60 , pp. 25-28
    • Marsaglia, G.1
  • 7
    • 0022196768 scopus 로고
    • Calculation of Minkowski-reduced lattice bases
    • L. Afflerbach and H. Grothe, Calculation of Minkowski-reduced lattice bases, Computing 35, 269-276 (1985).
    • (1985) Computing , vol.35 , pp. 269-276
    • Afflerbach, L.1    Grothe, H.2
  • 8
    • 0000413115 scopus 로고
    • How to calculate shortest vectors in a lattice
    • U. Dieter, How to calculate shortest vectors in a lattice, Math. Comput. 29, 827-833 (1975).
    • (1975) Math. Comput. , vol.29 , pp. 827-833
    • Dieter, U.1
  • 9
    • 84966232835 scopus 로고
    • β: An exhaustive analysis for β= 32 and a partial analysis for β= 48
    • β: An exhaustive analysis for β= 32 and a partial analysis for β= 48, Math. Comput. 54, 331-344 (1990).
    • (1990) Math. Comput. , vol.54 , pp. 331-344
    • Fishman, G.S.1
  • 11
    • 0028532684 scopus 로고
    • Several extensively tested random number generators
    • C. Kao and J.Y. Wong, Several extensively tested random number generators, Computers Ops. Res. 21, 1035-1039 (1994).
    • (1994) Computers Ops. Res. , vol.21 , pp. 1035-1039
    • Kao, C.1    Wong, J.Y.2
  • 13
    • 0024090481 scopus 로고
    • Random number generators: Good ones are hard to find
    • S.K. Park and K.W. Miller, Random number generators: Good ones are hard to find, Commun. of the ACM 31, 1192-1201 (1988).
    • (1988) Commun. of the ACM , vol.31 , pp. 1192-1201
    • Park, S.K.1    Miller, K.W.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.