default search action
"A Birthday Paradox for Markov Chains, with an Optimal Bound for Collision ..."
Jeong Han Kim et al. (2008)
- 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.