The Efficient Construction of an Unbiased Random Sequence
From MaRDI portal
Publication:5657582
Cited in
(22)- Fast simulation of new coins from old
- Simulation of a random variable and its application to game theory
- A survey of max-type recursive distributional equations
- Independent unbiased coin flips from a correlated biased source - a finite state Markov chain
- An asymptotically optimal Bernoulli factory for certain functions that can be expressed as power series
- Unconditionally secure short key ciphers based on data compression and randomization
- Asymptotically optimal perfect steganographic systems
- Optimal coin flipping
- Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources
- Sinai factors of nonsingular systems: Bernoulli shifts and Anosov flows
- Non-contextual chocolate balls versus value indefinite quantum cryptography
- How to extract useful randomness from unreliable sources
- Simulating BPP using a general weak random source
- Sharp entropy bounds for discrete statistical simulation
- An introduction to randomness extractors
- Randomness extraction in computability theory
- Coalgebraic tools for randomness-conserving protocols
- Constructions of plateaued correctors with high correction order and good nonlinearity via Walsh spectral neutralization technique
- Universal finitary codes with exponential tails
- From biased coin to any discrete distribution
- An efficient method for generating a discrete uniform distribution using a biased random source
- ASYMPTOTIC ANALYSIS OF PERES’ ALGORITHM FOR RANDOM NUMBER GENERATION
This page was built for publication: The Efficient Construction of an Unbiased Random Sequence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5657582)
