An optimal algorithm for simulation of true die by symmetric coin

MaRDI QIDQ1921659zbMATH OpenFDO

Authors Yanyan Li

Publication date 3 February 1997

Published in Vestnik St. Petersburg University. Mathematics (Search for Journal in Brave)

zbMATH Keywords

complexitydiscrete uniform distributionoptimal algorithmrandom bitsrandom variable

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10)

Recommendations

• Tree algorithms for unbiased coin tossing with a biased coin
• Optimal random number generation from a biased coin
• Generation of discrete distributions from biased coins
• How to turn loaded dice into fair coins
• Optimal coin flipping

Cited in

(4)

• Efficient simulations by a biased coin
• Remarks on the complexity of simulation of a ``simple geometric distribution
• Small collaboration: Modeling phenomena from nature by hyperbolic partial differential equations. Abstracts from the small collaboration held April 11--17, 2021 (hybrid meeting)
• Channel simulation by interval algorithm: a performance analysis of interval algorithm

This page was built for publication: An optimal algorithm for simulation of true die by symmetric coin

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1921659)