Pages that link to "Item:Q2361447"
From MaRDI portal
The following pages link to The expected bit complexity of the von Neumann rejection algorithm (Q2361447):
Displaying 4 items.
- Complexity of anticipated rejection algorithms and the Darling-Mandelbrot distribution (Q308957) (← links)
- Binary decompositions of probability densities and random-bit simulation (Q777909) (← links)
- An improved exact sampling algorithm for the standard normal distribution (Q2135885) (← links)
- On Global Costs and Nyquist's Theorem in Random Variate Generation (Q3833483) (← links)