A PCG: A Family of Simple Fast Space-Efficient Statistically Good Algorithms for Random Number Generation MELISSA E. O’NEILL, Harvey Mudd College This paper presents a new uniform pseudorandom number generation scheme

First Page		Document Content
Date: 2014-09-05 18:33:41 Theoretical computer science Linear congruential generator Mersenne twister Random number generation TestU01 Pseudorandomness RANDU Xorshift Lagged Fibonacci generator Pseudorandom number generators Mathematics Applied mathematics		A PCG: A Family of Simple Fast Space-Efficient Statistically Good Algorithms for Random Number Generation MELISSA E. O’NEILL, Harvey Mudd College This paper presents a new uniform pseudorandom number generation scheme Add to Reading List Source URL: www.pcg-random.org Download Document from Source Website File Size: 2,29 MB Share Document on Facebook

	Lecture Notes on Pseudorandomness { Part I Oded Goldreich Department of Computer Science Weizmann Institute of Science Rehovot, Israel. email: DocID: 1v2G7 - View Document
	Pseudorandomness for Network Algorithms Russell Impagliazzo ∗ Noam Nisan DocID: 1unPp - View Document
	Contents Pseudorandomness { Part II Introduction Lecture 1. Deterministic Simulation of Randomized Algorithms 1. Probabilistic Algorithms versus Deterministic Algorithms 2. De-randomization Under Complexity Assumptions DocID: 1ukkf - View Document
	Pseudorandomness Oded Goldreich Department of Computer Science and Applied Mathematics Weizmann Institute of Science, Rehovot, Israel. March 27, 2000 DocID: 1udL1 - View Document
	Pseudorandomness Thursday, September 21, :11 PM 2cf24dba5fb0a30e26e83b2ac5b9e29e1b161e5c1fa7425e73043362938b9824 DocID: 1tDzT - View Document