Tree algorithms for unbiased coin tossing with a biased coin

DOI10.1214/AOP/1176993384zbMATH Open0536.60018OpenAlexW2026900961MaRDI QIDQ791971FDOQ791971

Authors Q. F. Stout, Bette Warren

Publication date 1984

Published in The Annals of Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1214/aop/1176993384

zbMATH Keywords

optimal algorithmcoin tossingtree algorithms

Mathematics Subject Classification ID

Combinatorial probability (60C05) Stopping times; optimal stopping problems; gambling theory (60G40)

Recommendations

• Optimal random number generation from a biased coin
• Generation of discrete distributions from biased coins
• Efficient generation of fair dice with few biased coins
• Optimal coin flipping
• How to turn loaded dice into fair coins

Cited in

(12)

• Sharp entropy bounds for discrete statistical simulation
• Optimal coin flipping
• An instance-based algorithm for deciding the bias of a coin
• An efficient method for generating a discrete uniform distribution using a biased random source
• An optimal algorithm for simulation of true die by symmetric coin
• From biased coin to any discrete distribution
• Independent unbiased coin flips from a correlated biased source - a finite state Markov chain
• How to turn loaded dice into fair coins
• Efficient simulations by a biased coin
• Exact output rate of Peres's algorithm for random number generation
• Optimal random number generation from a biased coin
• An asymptotically optimal Bernoulli factory for certain functions that can be expressed as power series

This page was built for publication: Tree algorithms for unbiased coin tossing with a biased coin

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