ГО С Т Р ИСО 24153— 2012
Библиография
11] BAYS, С. and DURHAM. S.D. Improving a Poor Random Number Generator. ACM Transactions on Mathe
matical Software. 2 (1). 1976. pp. 59— 64
[2]BISSELL. A.F. Ordered random selection without replacement.
Applied Statistics.
35. 1986. pp. 73— 75
[3]BUCKLES. B.P. and LYBANON. M. Algorithm 515. Generation of a Vector from the Lexicographical Index.ACM
Transactions on Mathematical Software. 3 (2). 1977, pp. 180— 182
[4] BYERS. J.A. Random selection algorithms for spatial and temporal sampling. Computers in Biology and Medicine.
26. 1996. pp. 41— 52
[5] JACOBSON. M.T. and MATTHEWS. P. Generating uniformly distributed random Latin squares. Journal of Com
binatorial Design. 4. 1996. pp. 405— 437
[6]ISO.’lEC 9899:1999. Programming languages — C
[7] L’ECUYER. P. An Efficient and Portable Combined Random Number Generator. Communications of the
ACM.
31 (6). 1988. pp. 742— 749. 774
[8]MARSAGLIA, G. Random Number Generators. Journal of Modem Applied Statistical Methods. 2 (1). 2003,
pp. 2 -1 3
[9] MCCULLOUGH. B.D. Assessing the Reliability of Statistical Software: Part II. The American Statistician. Vol. 53.
No. 2 (May), 1999, pp. 149-159
[10]MCCULLOUGH. B.D. and WILSON. B. On the Accuracy of Statistical Procedures in Microsoft EXCEL 97. Compu
tational Statistics and Data Analysis. 31 (1). 1999. pp. 27— 37
]11]MCLEOD, A.!, and BELLHOUSE. D.R. A convenient algorithm for drawing a simple random sample. Applied
Statistics. 32. 1983. pp. 182— 184
[12]PARK. S.K. and MILLER. K.W. Random Number Generators: Good Ones are Hard to Find. Communications of
the ACM. 31 (10). 1988. pp. 1192— 1201
[13]PRESS. W.H., Teukolsky. S.A.. Vetterling. W.T.. and Flannery. B.P. Numerical Recipes in Fortran 77: The Art of
Scientific Computing. Second Edition (Volume 1 of Fortran Numerical Recipes). Cambridge University Press.
Cambridge. UK. 1992. 2001
[14]SOM. R.K. A Manual of Sampling Techniques. Heinemann Educational Books Ltd.. London, 1973
29