Conductance and the rapid mixing property for Markov chains: the approximation of permanent resolved
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A random polynomial time algorithm for approximating the volume of convex bodies
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
The electrical resistance of a graph captures its commute and cover times
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Stationarity detection in the initial transient problem
ACM Transactions on Modeling and Computer Simulation (TOMACS)
On the number of Eularian orientations of a graph
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Collisions among random walks on a graph
SIAM Journal on Discrete Mathematics
Lifting Markov chains to speed up mixing
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Faster mixing via average conductance
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Reversal of Markov Chains and the Forget Time
Combinatorics, Probability and Computing
Blocking Conductance and Mixing in Random Walks
Combinatorics, Probability and Computing
Exit frequency matrices for finite markov chains
Combinatorics, Probability and Computing
| Hi-index | 0.00 |