@inproceedings{WSC92*97, author = {David Goldsman}, title = {Simulation output analysis}, booktitle = {Proceedings of the 24th Winter Simulation Conference}, month = {December}, year = {1992}, isbn = {0-7803-0798-4}, pages = {97--103}, location = {Arlington, Virginia, United States}, doi = {http://doi.acm.org/10.1145/167293.167310}, publisher = {ACM Press} }

@inproceedings{WSC93*41, author = {John M.~Charnes}, title = {Statistical analysis of output processes}, booktitle = {Proceedings of the 25th Winter Simulation Conference}, month = {December}, year = {1993}, isbn = {0-7803-1381-X}, pages = {41--49}, location = {Los Angeles, California, United States}, doi = {http://doi.acm.org/10.1145/256563.256579}, publisher = {ACM Press} }

@article{272995, author = {Makoto Matsumoto and Takuji Nishimura}, title = {Mersenne {Twister}: {A} 623-dimensionally equidistributed uniform pseudo-random number generator}, journal = {ACM Trans. Model. Comput. Simul.}, volume = {8}, number = {1}, year = {1998}, issn = {1049-3301}, pages = {3--30}, doi = {http://doi.acm.org/10.1145/272991.272995}, publisher = {ACM Press}, abstract = { A new algorithm called Mersenne Twister (MT) is proposed for generating uniform pseudorandom numbers. For a particular choice of parameters, the algorithm provides a super astronomical period of 219937 ?1 and 623-dimensional equidistribution up to 32-bit accuracy, while using a working area of only 624 words. This is a new variant of the previously proposed generators, TGFSR, modified so as to admit a Mersenne-prime period. The characteristic polynomial has many terms. The distribution up to v bits accuracy for 1 $\leq$ v $\leq$ 32 is also shown to be good. An algorithm is also given that checks the primitivity of the characteristic polynomial of MT with computational complexity O(p2) where p is the degree of the polynomial.We implemented this generator in portable C-code. It passed several stringent statistical tests, including diehard. Its speed is comparable to other modern generators. Its merits are due to the efficient algorithms that are unique to polynomial calculations over the two-element field. } }

*This file was generated by
bibtex2html 1.96.*