Using stopping times to bound mixing times

Authors:
Igor Pak
Affiliations:
Department of Mathematics, Yale University
Venue:
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Year:
1999

Citing 1
Cited 1

Strong uniform times and finite random walks

Advances in Applied Mathematics

Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.02

Visualization

Abstract