| 2009 |
|---|
| 8 | EE | Ravi Montenegro:
The simple random walk and max-degree walk on a directed graph.
Random Struct. Algorithms 34(3): 395-407 (2009) |
| 2008 |
|---|
| 7 | EE | Jeong Han Kim,
Ravi Montenegro,
Yuval Peres,
Prasad Tetali:
A Birthday Paradox for Markov Chains, with an Optimal Bound for Collision in the Pollard Rho Algorithm for Discrete Logarithm.
ANTS 2008: 402-415 |
| 2007 |
|---|
| 6 | EE | Jeong Han Kim,
Ravi Montenegro,
Prasad Tetali:
Near Optimal Bounds for Collision in Pollard Rho for Discrete Log.
FOCS 2007: 215-223 |
| 2006 |
|---|
| 5 | EE | Ravi Kannan,
László Lovász,
Ravi Montenegro:
Blocking Conductance and Mixing in Random Walks.
Combinatorics, Probability & Computing 15(4): 541-570 (2006) |
| 2005 |
|---|
| 4 | EE | Ravi Montenegro,
Prasad Tetali:
Mathematical Aspects of Mixing Times in Markov Chains.
Foundations and Trends in Theoretical Computer Science 1(3): (2005) |
| 3 | EE | Ravi Montenegro:
Vertex and edge expansion properties for rapid mixing.
Random Struct. Algorithms 26(1-2): 52-68 (2005) |
| 2003 |
|---|
| 2 | EE | Ravi Kannan,
Michael W. Mahoney,
Ravi Montenegro:
Rapid Mixing of Several Markov Chains for a Hard-Core Model.
ISAAC 2003: 663-675 |
| 2001 |
|---|
| 1 | EE | Ravi Montenegro,
Jung-Bae Son:
Edge isoperimetry and rapid mixing on matroids and geometric Markov chains.
STOC 2001: 704-711 |
