1. Josh D. Cohen, Fairing of biased Coins in Bounded Time,Yale Computer Science Technical Report 372 (1985).
2. Peter Elias, The Efficient Construction of an Unbiased Random Sequence, Ann. Math. Statist.43 (1972), 865–870.
3. Benny Chor andOded Goldreich, Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity,Proc. 26 th IEEE FOCS (1985), 429–442.
4. R. G. Gallager,Information Theory and Reliable Communication, Wiley, New York (1968).
5. Miklós Sántha andUmesh V. Vazirani, Generating Quasi-Random Sequences from Slightly-Random Sources,Proc. 25 th IEEE FOCS (1985), 434–440. The following paper has a comprehensive bibliography: