The biased coin problem

SIAM Journal on Discrete Mathematics

Volumn 9, Issue 1, 1996, Pages 29-36

  Boppana, Ravi B ^a   Narayanan, Babu O ^b,c,d  

^a POLYTECHNIC UNIVERSITY   (United States)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^c RUTGERS UNIVERSITY   (United States)

^d UNIVERSITY OF MINNESOTA   (United States)

Author keywords

Pseudo randomness; Randomized algorithms; Slightly random sources

Indexed keywords

BIASED COIN; COIN FLIPPING; CONDITIONAL PROBABILITY; RANDOM EVENT; RANDOMIZATION;

ALGORITHMS;

PROBABILITY;

EID: 0030376540     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/0409004     Document Type: Article

References (15)

1. N. ALON AND M. NAOR, Coin-flipping games immune against linear-sized coalitions, SIAM J. Comput., 22 (1993), pp. 403-417.
2. N. ALON AND M. O. RABIN, Biased coins and randomized algorithms, in Advances in Computing Research 5, S. Micali, ed., JAI Press Inc., Greenwich, CT, 1989, pp. 499-507.
3. N. ALON AND J. SPENCER, The Probabilistic Method, John Wiley & Sons Inc., New York, 1992.
4. M. BEN-OR AND N. LINIAL, Collective coin flipping, in Advances in Computing Research 5, S. Micali, ed., JAI Press Inc., Greenwich, CT, 1989, pp. 91-116.
5. M. BEN-OR, N. LINIAL, AND M. SAKS, Collective coin flipping and other models of imperfect randomness, in Proc. 7th Hungarian Conference on Combinatorics, Colloq. Math. Soc. János Bolyai 52, North-Holland, Amsterdam, 1987, pp. 77-112.
6. R. BOPPANA AND B. NARAYANAN, The biased coin problem, in Proc. 25th Annual ACM Symposium on the Theory of Computing, 1993, pp. 252-257.
7. _, Perfect-information leader election with optimal resilience, manuscript.
8. B. CHOR AND O. GOLDREICH, Unbiased bits from sources of weak randomness and probabilistic communication complexity, SIAM J. Comput., 17 (1988), pp. 230-261.
9. G. H. HARDY, J. E. LITTLEWOOD, AND G. POLYA, Inequalities, 2nd ed., Cambridge University Press, Cambridge, 1952.
10. H. F. MURRY, A general approach for generating natural random variables, IEEE Trans. Comput., C-19 (1970), pp. 1210-1213.
11. M. SANTHA AND U. V. VAZIRANI, Generating quasi-random sequences from semi-random sources, J. Comput. System Sci., 33 (1986), pp. 75-87.
12. E. SHAMIR, A Slightly Random Source Confronts a Random Witness-Set, Technical Report CS-87-9d, Leibniz Center for Research in Computer Science, Hebrew University, Jerusalem, 1988.
13. U. V. VAZIRANI, Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources, Combinatorica, 7 (1987), pp. 375-392.
14. U. V. VAZIRANI AND V. V. VAZIRANI, Random polynomial time is equal to slightly-random polynomial time, in Proc. 26th Annual IEEE Symposium on Foundations of Computer Science, 1985, pp. 417-428.
15. D. ZUCKERMAN, Simulating BPP using a general weak random source, in Proc. 32nd Annual IEEE Symposium on Foundations of Computer Science, 1991, pp. 79-89.