| Publication | Date of Publication | Type |
|---|
Groups of rotating squares
(available as arXiv preprint) | 2016-07-20 | Paper |
Collision of random walks and a refined analysis of attacks on the discrete logarithm problem
Lecture Notes in Computer Science | 2015-08-27 | Paper |
Edge isoperimetry and rapid mixing on matroids and geometric Markov chains
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
How long does it take to catch a wild kangaroo?
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
Intersection conductance and canonical alternating paths: methods for general finite Markov chains
Combinatorics, Probability and Computing | 2014-08-06 | Paper |
Mathematical aspects of mixing times in Markov chains.
Foundations and Trends® in Theoretical Computer Science | 2010-09-08 | Paper |
A birthday paradox for Markov chains with an optimal bound for collision in the Pollard rho algorithm for discrete logarithm
The Annals of Applied Probability | 2010-05-06 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
The simple random walk and max-degree walk on a directed graph
Random Structures & Algorithms | 2009-06-16 | Paper |
A birthday paradox for Markov chains, with an optimal bound for collision in the Pollard rho algorithm for discrete logarithm
Lecture Notes in Computer Science | 2008-05-27 | Paper |
A sharp isoperimetric bound for convex bodies
Israel Journal of Mathematics | 2008-04-01 | Paper |
Sharp edge, vertex, and mixed Cheeger inequalities for finite Markov kernels
Electronic Communications in Probability | 2007-11-19 | Paper |
Sharp edge, vertex, and mixed Cheeger inequalities for finite Markov kernels
Electronic Communications in Probability | 2007-11-19 | Paper |
Blocking Conductance and Mixing in Random Walks
Combinatorics, Probability and Computing | 2007-07-30 | Paper |
Eigenvalues of non-reversible Markov chains: their connection to mixing times
(available as arXiv preprint) | 2007-01-01 | Paper |
| Near Optimal Bounds for Collision in Pollard Rho for Discrete Log | 2006-11-19 | Paper |
Mixing time bounds via the spectral profile
Electronic Journal of Probability | 2006-11-03 | Paper |
Mixing time bounds via the spectral profile
Electronic Journal of Probability | 2006-11-03 | Paper |
| Duality and evolving set bounds on mixing times | 2006-07-02 | Paper |
| Eigenvalues of non-reversible Markov chains: their connection to mixing times | 2006-04-17 | Paper |
Duality and evolving set bounds on mixing times
(available as arXiv preprint) | 2006-01-01 | Paper |
Near Optimal Bounds for Collision in Pollard Rho for Discrete Log
(available as arXiv preprint) | 2006-01-01 | Paper |
Vertex and edge expansion properties for rapid mixing
Random Structures & Algorithms | 2005-04-21 | Paper |
