Interval algorithm for random number generation
From MaRDI portal
Publication:4340328
DOI10.1109/18.556116zbMath0876.65001MaRDI QIDQ4340328
Publication date: 12 November 1997
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.556116
65G30: Interval and finite arithmetic
65C10: Random number generation in numerical analysis
94B40: Arithmetic codes
Related Items
On the complexity of binary floating point pseudorandom generation, The expected bit complexity of the von Neumann rejection algorithm, Random-Bit Optimal Uniform Sampling for Rooted Planar Trees with Given Sequence of Degrees and Applications, Universal finitary codes with exponential tails