Pages that link to "Item:Q4340328"
From MaRDI portal
The following pages link to Interval algorithm for random number generation (Q4340328):
Displayed 4 items.
- On the complexity of binary floating point pseudorandom generation (Q293511) (← links)
- The expected bit complexity of the von Neumann rejection algorithm (Q2361447) (← links)
- Random-Bit Optimal Uniform Sampling for Rooted Planar Trees with Given Sequence of Degrees and Applications (Q2795938) (← links)
- Universal finitary codes with exponential tails (Q3434058) (← links)