Interval algorithm for random number generation
From MaRDI portal
Publication:4340328
Recommendations
- scientific article; zbMATH DE number 1512196
- Algorithms for Generating Discrete Random Variables with a Given Generating Function or a Given Moment Sequence
- scientific article; zbMATH DE number 1568867
- The generation of binary trees as a numerical problem
- Optimized random number generation in an interval
Cited in
(11)- Coalgebraic tools for randomness-conserving protocols
- Interval Algorithm for Random Number Generation: Information Spectrum Approach
- Improved device-independent randomness expansion rates using two sided randomness
- Universal finitary codes with exponential tails
- The expected bit complexity of the von Neumann rejection algorithm
- Randomness extraction in computability theory
- scientific article; zbMATH DE number 1512196 (Why is no real title available?)
- On the complexity of binary floating point pseudorandom generation
- Simple and tight device-independent security proofs
- Optimized random number generation in an interval
- Random-bit optimal uniform sampling for rooted planar trees with given sequence of degrees and applications
This page was built for publication: Interval algorithm for random number generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4340328)