Iterating von Neumann's procedure for extracting random bits
From MaRDI portal
Recommendations
Cited in
(22)- Fast simulation of new coins from old
- Extraction rates of random continuous functionals
- An asymptotically optimal Bernoulli factory for certain functions that can be expressed as power series
- Quantum Random Number Generation
- Fast and efficient construction of an unbiased random sequence
- Extraction of optimally unbiased bits from a biased source
- Optimal coin flipping
- Bounds on Fixed Input/Output Length Post-processing Functions for Biased Physical Random Number Generators
- Proved random numbers obtained from hardware devices
- Sinai factors of nonsingular systems: Bernoulli shifts and Anosov flows
- Simulating events of unknown probabilities via reverse time martingales
- Non-contextual chocolate balls versus value indefinite quantum cryptography
- An introduction to randomness extractors
- Randomness extraction in computability theory
- Coalgebraic tools for randomness-conserving protocols
- Heat-Bath Algorithmic Cooling with Correlated-Qubits Relaxation
- Universal finitary codes with exponential tails
- New coins from old, smoothly
- A quantum random number generator certified by value indefiniteness
- Some factors of nonsingular Bernoulli shifts
- Von Neumann's biased coin revisited
- ASYMPTOTIC ANALYSIS OF PERES’ ALGORITHM FOR RANDOM NUMBER GENERATION
This page was built for publication: Iterating von Neumann's procedure for extracting random bits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1192995)