Xorshift RNGs

467Citations
Citations of this article
230Readers
Mendeley users who have this article in their library.

Abstract

Description of a class of simple, extremely fast random number generators (RNGs) with periods 2k-1 for k = 32, 64, 96, 128, 160, 192. These RNGs seem to pass tests of randomness very well.

Cite

CITATION STYLE

APA

Marsaglia, G. (2003). Xorshift RNGs. Journal of Statistical Software, 8, 1–6. https://doi.org/10.18637/jss.v008.i14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free