Biased random walks

Combinatorica

Volumn 16, Issue 1, 1996, Pages 1-18

  Azar, Yossi ^e   Broder, Andrei Z ^a   Karlin, Anna R ^b   Linial, Nathan ^c   Phillips, Steven ^d  

^a HEWLETT PACKARD COMPANY   (United States)

^b University of Washington   (United States)

^c HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^d LUCENT TECHNOLOGIES   (United States)

^e NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039338076     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01300124     Document Type: Article

References (19)

1. M. AJTAI, J. KOMLÓS, and E. SZEMERÉDI: Deterministic Simulation in LOGSPACE, 19th Annual ACM STOC, 1987, 132-140.
2. M. AJTAI, and N. LINIAL: The influence of large coalitions, Combinatorica, 13 (1993) 129-145.
3. N. ALON, and M. NAOR: Coin-flipping Games Immune Against Linear-sized Coalitions, SIAM J. Comput 22 (1993), 403-417.
4. N. ALON, and M. O. RABIN: Biased Coins and Randomized Algorithms, in Randomness and Computation (S. Micali ed.) Advances in Computing Research, Vol. 5, 499-507.
5. Y. AZAR. A. Z. BRODER, A. R. KARLIN, N. LINIAL, and S. J. PHILLIPS: Biased Random Walks, in 24th Annual ACM STOC, 1992, 1-9.
6. M. BEN-OR, and N. LINIAL: Collective coin flipping, in Randomness and Computation (S. Micali ed.) Academic Press, New York, 1990, 91-115.
7. M. BEN-OR, N. LINIAL, and M. SAKS: Collective coin flipping and other models of imperfect randomness, in Collog. Math Soc. János Bolyai no. 52, Combinatorics Eger, 1987, 75-112.
8. A. COHEN, and A. WIGDERSON: Dispersera, Deterministic Amplification, and Weak Random Sources, 30th Annual IEEE FOCS, 1989, 14-19.
9. C. DERMAN: Finite State Markov Decision Processes, Academic Press, New York, 1970.
10. O. GOLDREICH, S. GOLDWASSER, and N. LINIAL: Fault-tolerant Computation in the Full Information Model, 32nd Annual IEEE FOCS, 1991, 447-457.
11. E. J. HINCH: Perturbation methods, Cambridge University Press, 1991.
12. R. IMPAGLIAZZO, and D. ZUCKERMAN: How to Recycle Random Bits, 30th Annual IEEE FOCS, 1989, 248-253.
13. T. KATO: Perturbation theory for linear operators, New York, Springer Verlag, 1982.
14. D. LICHTENSTEIN, N. LINIAL, and M. SAKS: Some extremal problems arising from discrete control processes, Combinatorica, 9 (1989), 269-287.
15. M. METROPOLIS, A. ROSENBLUTH, M. ROSENBLUTH, A. TELLER, and M. TELLER: Equation of state calculations by fast computing machines, Journal of Chemical Physics 21 (1953), 1087-1092.
16. F. RELLICH: Perturbation theory of eigenvalue problems, New York, Gordon and Breach, 1969.
17. M. SANTHA, and U. VAZIRANI: Generating Quasi-Random Sequences from Semi-random Sources, J. Comput. System Sci. 33 (1986), 75-87.
18. U. VAZIRANI: Efficiency Considerations in Using Slightly-Random Sources, 19th Annual ACM STOC, 1987, 160-168.
19. U. VAZIRANI: Randomness, Adversaries and Computation, Ph.D. Thesis, University of California, Berkeley, 1986.