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
Efficient stopping rules for Markov chains
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Random walks and an O*(n5) volume algorithm for convex bodies
Random Structures & Algorithms
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Edge isoperimetry and rapid mixing on matroids and geometric Markov chains
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Mixing time and long paths in graphs
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Improved bounds for sampling contingency tables
Random Structures & Algorithms
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Solving convex programs by random walks
Journal of the ACM (JACM)
Mathematical aspects of mixing times in Markov chains
Foundations and Trends® in Theoretical Computer Science
The geometry of logconcave functions and sampling algorithms
Random Structures & Algorithms
The evolution of the mixing rate of a simple random walk on the giant component of a random graph
Random Structures & Algorithms
Approximations for the isoperimetric and spectral profile of graphs and related parameters
Proceedings of the forty-second ACM symposium on Theory of computing
Partial information spreading with application to distributed maximum coverage
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
| Hi-index | 0.00 |