Ravi Montenegro Vertex and edge expansion properties for rapid mixing. [Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 2005, v:26, n:1-2, pp:52-68 [Journal]
A Birthday Paradox for Markov Chains, with an Optimal Bound for Collision in the Pollard Rho Algorithm for Discrete Logarithm. [Citation Graph (, )][DBLP]
Near Optimal Bounds for Collision in Pollard Rho for Discrete Log. [Citation Graph (, )][DBLP]
How long does it take to catch a wild kangaroo? [Citation Graph (, )][DBLP]
Blocking Conductance and Mixing in Random Walks. [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.001secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP