ASYMPTOTIC ANALYSIS OF PERES’ ALGORITHM FOR RANDOM NUMBER GENERATION

DOI10.1017/S0269964820000510OpenAlexW3093301016MaRDI QIDQ5051175

Chen-Tuo Liao, Zhao Ging Lim, Yi-Ching Yao

Publication date: 22 November 2022

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0269964820000510

zbMATH Keywords

entropyanalysis of algorithmssuperadditivityregularly varying sequenceElias' extractorPeres' extractorvon Neumann's extractor

Mathematics Subject Classification ID

Statistics (62-XX) Computer science (68-XX)

Cites Work

• Unnamed Item
• Iterating von Neumann's procedure for extracting random bits
• Fast simulation of new coins from old
• Exact output rate of Peres's algorithm for random number generation
• A unified theory of regularly varying sequences
• Randomizing Functions: Simulation of a Discrete Probability Distribution Using a Source of Unknown Distribution
• Fast and efficient construction of an unbiased random sequence
• Fast enumeration of combinatorial objects
• Entropy computations via analytic depoissonization
• A Bernoulli factory
• The Efficient Construction of an Unbiased Random Sequence

This page was built for publication: ASYMPTOTIC ANALYSIS OF PERES’ ALGORITHM FOR RANDOM NUMBER GENERATION