106 citations · 352 across the 51 of their papers we have counts for
Showing 2015 · cs.ITShow all
2 papers · 2 filters
cs.IT2015★ 6 cited
The expected bit complexity of the von Neumann rejection algorithm
Luc Devroye, Claude Gravel
In 1952, von Neumann introduced the rejection method for random variate generation. We revisit this algorithm when we have a source of perfect bits at our disposal. In this random…
cs.IT2015★ 3 cited
Random variate generation using only finitely many unbiased, independently and identically distributed random bits
Luc Devroye, Claude Gravel
For any discrete probability distributions with bounded entropy, we can generate exactly a random variate using only a finite expected number of perfect coin flips. A perfect coin…