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 A Birthday Paradox for Markov Chains, with an Optimal Bound for Collision in the Pollard Rho Algorithm for Discrete Logarithm. 402-415 2008 ANTS http://dx.doi.org/10.1007/978-3-540-79456-1_27 conf/ants/2008 db/conf/ants/ants2008.html#KimMPT08