Edge isoperimetry and rapid mixing on matroids and geometric Markov chains. - Ravi Montenegro; Jung-Bae Son (STOC, 2001)

Rapid Mixing of Several Markov Chains for a Hard-Core Model. - Ravi Kannan; Michael W. Mahoney; Ravi Montenegro (ISAAC, 2003)

Mathematical Aspects of Mixing Times in Markov Chains. - Ravi Montenegro; Prasad Tetali (Found. Trends Theor. Comput. Sci., 2005)

Vertex and edge expansion properties for rapid mixing. - Ravi Montenegro (Random Struct. Algorithms, 2005)

Blocking Conductance and Mixing in Random Walks. - Ravi Kannan; László Lovász 001; Ravi Montenegro (Comb. Probab. Comput., 2006)

Near Optimal Bounds for Collision in Pollard Rho for Discrete Log. - Jeong Han Kim; Ravi Montenegro; Prasad Tetali (FOCS, 2007)

A Birthday Paradox for Markov Chains, with an Optimal Bound for Collision in the Pollard Rho Algorithm for Discrete Logarithm. - Jeong Han Kim; Ravi Montenegro; Yuval Peres; Prasad Tetali (ANTS, 2008)

How long does it take to catch a wild kangaroo? - Ravi Montenegro; Prasad Tetali (STOC, 2009)

The simple random walk and max-degree walk on a directed graph. - Ravi Montenegro (Random Struct. Algorithms, 2009)

Intersection Conductance and Canonical Alternating Paths: Methods for General Finite Markov Chains. - Ravi Montenegro (Comb. Probab. Comput., 2014)

Collision of Random Walks and a Refined Analysis of Attacks on the Discrete Logarithm Problem. - Shuji Kijima; Ravi Montenegro (Public Key Cryptography, 2015)