Pages that link to "Item:Q4340328"
From MaRDI portal
The following pages link to Interval algorithm for random number generation (Q4340328):
Displaying 11 items.
- On the complexity of binary floating point pseudorandom generation (Q293511) (← links)
- Optimized random number generation in an interval (Q989468) (← 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)
- (Q4505841) (← links)
- Simple and Tight Device-Independent Security Proofs (Q4629390) (← links)
- Interval Algorithm for Random Number Generation: Information Spectrum Approach (Q5123813) (← links)
- Randomness extraction in computability theory (Q5880936) (← links)
- Coalgebraic tools for randomness-conserving protocols (Q5925546) (← links)
- Improved device-independent randomness expansion rates using two sided randomness (Q6559633) (← links)