|
481
|
A pseudorandom generator from any one-way function
– Hastad, Impagliazzo, et al.
- 1999
|
|
478
|
How to generate cryptographically strong sequences of pseudo-random bit
– Blum, Micali
- 1984
|
|
421
|
Theory and applications of trapdoor functions
– Yao
- 1982
|
|
163
|
Reversible Markov Chains and Random walks on Graphs,” Book in preparation; available at http://www.stat.berkeley.edu/∼aldous
– Aldous, Fill
|
|
162
|
Random Walks and Electric Networks
– Doyle, Snell
- 1984
|
|
125
|
Random walks, universal traversal sequences, and the complexity of maze problems
– Aleliunas, Karp, et al.
- 1979
|
|
117
|
Pseudorandom generators for space-bounded computation
– Nisan
- 1992
|
|
87
|
The electrical resistance of a graph captures its commute and cover times
– Chandra, Raghavan, et al.
- 1989
|
|
43
|
Collisions among random walks on a graph
– Coppersmith, Tetali, et al.
- 1993
|
|
38
|
Covering problems for Brownian motion on spheres
– Matthews
- 1988
|
|
33
|
Random walks and the effective resistance of networks
– Tetali
- 1991
|
|
30
|
Bounds on the cover time
– Broder, Karlin
- 1989
|
|
26
|
Approximate inclusion-exclusion
– Linial, Nisan
- 1990
|
|
25
|
On the cover time of random walks on graphs
– Kahn, Linial, et al.
- 1989
|
|
24
|
A Tight Upper Bound on the Cover Time for Random Walks on Graphs
– Feige
- 1995
|
|
21
|
A tight lower bound for the cover time of random walks on graphs, Random structures and algorithms 6
– Feige
- 1995
|
|
20
|
A technique for lower bounding the cover time
– Zuckerman
- 1992
|
|
13
|
Inclusion-exclusion: Exact and approximate
– Kahn, Linial, et al.
- 1996
|
|
10
|
Random walks on regular and irregular graphs
– Coppersmith, Feige, et al.
- 1996
|
|
4
|
Collecting Coupons on Trees, and the Analysis of Random Walks
– Feige
- 1993
|
|
4
|
Design of on-line algorithms using hitting times
– Tetali
- 1999
|
|
