Binomial random variate generation
Communications of the ACM
Simulating Size-constrained Galton-Watson Trees
SIAM Journal on Computing
| Hi-index | 0.00 |
The FORTRAN implementation of an exact, uniformly fast algorithm for generating the binomial, random variables is presented. The algorithm is numerically stable and is faster than other published algorithms. The code uses only standard FORTRAN statements and is portable to most computers; it has been tested on the IBM 370, 3033, 4381, DEC VAX 11/780, SUN 3/50, CDC 6500-6600, ENCORE Multimax, and Apple Mcintosh Plus. A driver program is also included.