Efficient generation of fair dice with few biased coins

DOI10.1109/18.771228MaRDI QIDQ4701418zbMATHOpenAlexFDO

Authors Luisa Gargano, Ugo Vaccaro

Publication date 21 November 1999

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/f516916ae73733de3aff3e931d03790177926bd5

zbMATH Keywords

algorithmbiased coinsgeneration of fair diceminimum average time

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Combinatorial probability (60C05)

Recommendations

• Simulating fair dice with biased coins
• scientific article; zbMATH DE number 4117876
• On dice and coins: Models of computation for random generation
• How to turn loaded dice into fair coins

Cited in

(12)

• On Parrondo's paradox: how to construct unfair games by composing fair games
• Small collaboration: Modeling phenomena from nature by hyperbolic partial differential equations. Abstracts from the small collaboration held April 11--17, 2021 (hybrid meeting)
• From biased coin to any discrete distribution
• Tree algorithms for unbiased coin tossing with a biased coin
• How to turn loaded dice into fair coins
• Blind-friendly von Neumann's heads or tails
• Efficient simulations by a biased coin
• Slice algorithms for counting in \(U\)-dimensional space
• scientific article; zbMATH DE number 4117876 (Why is no real title available?)
• Optimal random number generation from a biased coin
• Randomizing Functions: Simulation of a Discrete Probability Distribution Using a Source of Unknown Distribution
• Making a fair roulette from a possibly biased coin

This page was built for publication: Efficient generation of fair dice with few biased coins

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