Ravi Montenegro

According to our database1, Ravi Montenegro authored at least 11 papers between 2001 and 2015.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2015
Collision of Random Walks and a Refined Analysis of Attacks on the Discrete Logarithm Problem.
Proceedings of the Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30, 2015

2014
Intersection Conductance and Canonical Alternating Paths: Methods for General Finite Markov Chains.
Comb. Probab. Comput., 2014

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

How long does it take to catch a wild kangaroo?
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

2008
A Birthday Paradox for Markov Chains, with an Optimal Bound for Collision in the Pollard Rho Algorithm for Discrete Logarithm.
Proceedings of the Algorithmic Number Theory, 8th International Symposium, 2008

2007
Near Optimal Bounds for Collision in Pollard Rho for Discrete Log.
Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

2006
Blocking Conductance and Mixing in Random Walks.
Comb. Probab. Comput., 2006

2005
Vertex and edge expansion properties for rapid mixing.
Random Struct. Algorithms, 2005

Mathematical Aspects of Mixing Times in Markov Chains.
Found. Trends Theor. Comput. Sci., 2005

2003
Rapid Mixing of Several Markov Chains for a Hard-Core Model.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

2001
Edge isoperimetry and rapid mixing on matroids and geometric Markov chains.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001


  Loading...