Pages that link to "Item:Q921846"
From MaRDI portal
The following pages link to Generating random numbers by adapted rejection (Q921846):
Displaying 14 items.
- Complexity of anticipated rejection algorithms and the Darling-Mandelbrot distribution (Q308957) (← links)
- A generalization of the adaptive rejection sampling algorithm (Q637995) (← links)
- Patchwork rejection algorithms (Q915340) (← links)
- A batch acceptance complement method for generating random variables (Q1105312) (← links)
- Multiple use of random numbers in discrete-event simulation (Q1122924) (← links)
- A one-table method for sampling from continuous and discrete distributions (Q1345428) (← links)
- A note on transformed density rejection (Q1592540) (← links)
- An alias method for sampling from the normal distribution (Q1825579) (← links)
- On the Crack random numbers generation procedure (Q2010180) (← links)
- Random numbers from the tails of probability distributions using the transformation method (Q2347310) (← links)
- The expected bit complexity of the von Neumann rejection algorithm (Q2361447) (← links)
- Generating random numbers by using acceptance rejection method (Q2923995) (← links)
- On Global Costs and Nyquist's Theorem in Random Variate Generation (Q3833483) (← links)
- Asymptotically Optimal Design Points for Rejection Algorithms (Q5719263) (← links)
