Optimal Coin Flipping

DOI10.1007/978-3-319-06880-0_21zbMath1407.68234OpenAlexW2159359763MaRDI QIDQ5418975

Dexter Kozen

Publication date: 2 June 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-06880-0_21

zbMATH Keywords

entropyrandomnessprobabilistic protocols

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Fractals (28A80)

Cites Work

• Iterating von Neumann's procedure for extracting random bits
• Extracting randomness: A survey and new constructions
• Independent unbiased coin flips from a correlated biased source - a finite state Markov chain
• Randomness is linear in space
• Recursive coalgebras of finitary functors
• Corecursive Algebras: A Study of General Structured Corecursion
• Computing with Very Weak Random Sources
• Elgot Algebras
• Coinductive Proof Principles for Stochastic Processes
• The Efficient Construction of an Unbiased Random Sequence
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal Coin Flipping