MathSciNet Relay Station
MathSciNet bibliographic data
MR2467861 11Y16 (11Y05 94A60)
Kim, Jeong Han; Montenegro, Ravi; Peres, Yuval; Tetali, Prasad A birthday paradox for Markov chains, with an optimal bound for collision in the Pollard rho algorithm for discrete logarithm. Algorithmic number theory, 402–415, Lecture Notes in Comput. Sci., 5011, Springer, Berlin, 2008.
For users without a MathSciNet license , Relay Station allows linking from MR numbers in online mathematical literature directly to electronic journals and original articles. Subscribers receive the added value of full MathSciNet reviews.

Username/Password Subscribers access MathSciNet here

AMS Home Page

American Mathematical Society American Mathematical Society
201 Charles Street
Providence, RI 02904-6248 USA
© Copyright 2017, American Mathematical Society
Privacy Statement