Tree algorithms for unbiased coin tossing with a biased coin

DOI10.1214/aop/1176993384zbMath0536.60018OpenAlexW2026900961MaRDI QIDQ791971

Bette Warren, Quentin F. Stout

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)

Related Items (6)

Efficient simulations by a biased coin ⋮ An efficient method for generating a discrete uniform distribution using a biased random source ⋮ Sharp entropy bounds for discrete statistical simulation ⋮ An asymptotically optimal Bernoulli factory for certain functions that can be expressed as power series ⋮ From biased coin to any discrete distribution ⋮ Independent unbiased coin flips from a correlated biased source - a finite state Markov chain

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