Pseudorandom walks on regular digraphs and the RL vs. L problem

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Omer Reingold Weizmann Institute of Science, Rehovot, Israel
Luca Trevisan U.C. Berkeley
Salil Vadhan Harvard University, Cambridge, MA
Published in:
· Proceeding
STOC '06 Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Pages 457 - 466
ACM New York, NY, USA ©2006
table of contents ISBN:1-59593-134-1 doi>10.1145/1132516.1132583
Pseudorandom walks on regular digraphs and the RL vs. L problem Published by ACM 2006 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 4
· Downloads (12 Months): 46
· Downloads (cumulative): 556
· Citation Count: 6


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder