|
1
|
Deterministic Approximation of the Cover Time
– Uriel Feige, Yuri Rabinovich
|
|
|
Cover Times
– David Aldous, James Allen Fill
- 1994
|
|
3
|
Collecting Coupons On Trees, And The Cover Time Of Random Walks
– Uriel Feige
|
|
10
|
Random Walks on Regular and Irregular Graphs
– Don Coppersmith, Uriel Feige, James Shearer
- 1993
|
|
5
|
Collecting Coupons on Trees, and the Analysis of Random Walks
– Uriel Feige
- 1994
|
|
6
|
The Power of Choice in Random Walks: An Empirical Study
– Chen Avin, Bhaskar Krishnamachari
- 2006
|
|
13
|
Many Random Walks Are Faster Than One
– Noga Alon, Chen Avin, Gady Kozma, Zvi Lotker, Mark R. Tuttle
|
|
26
|
Short Random Walks On Graphs
– Greg Barnes, Uriel Feige
- 1993
|
|
118
|
THE ELECTRICAL RESISTANCE OF A GRAPH CAPTURES ITS COMMUTE AND COVER TIMES
– Ashok K. Chandra, Prabhakar Raghavan, Walter L. Ruzzo, Roman Smolensky, Prasoon Tiwari
|
|
19
|
On the cover time and mixing time of random geometric graphs
– Chen Avin, Gunes Ercal
- 2007
|
|
15
|
On the Cover Time of Random Geometric Graphs
– Chen Avin, Gunes Ercal
- 2005
|
|
|
Improved Approximation of the Minimum Cover Time
– Eden Chlamtac, Uriel Feige
- 2005
|
|
|
An Upper Bound on the Cover Time for Powers of Graphs
– Johan Jonasson
- 1999
|
|
40
|
A Tight Upper Bound on the Cover Time for Random Walks on Graphs
– Uriel Feige
- 1995
|
|
5
|
Multiple Cover Time
– Peter Winkler, David Zuckerman
- 1996
|
|
24
|
A Technique for Lower Bounding the Cover Time
– David Zuckerman
- 1992
|
|
173
|
Random Walks on Graphs: A Survey
– L. Lovász
- 1993
|
|
4
|
On the Time to Traverse All Edges of a Graph
– David Zuckerman
- 1997
|
|
|
Many Random Walks Are Faster Than One
– n.n.
- 2006
|
