Many random walks are faster than one

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Noga Alon Tel Aviv University, Tel Aviv, Israel
Chen Avin Ben Gurion University of the Negev, Beer-Sheva, Israel
Michal Koucky Czech Academy of Sciences, Prague, Czech Rep
Gady Kozma Weizmann Institute of Science, Rehovot, Israel
Zvi Lotker Ben Gurion University of the Negev, Beer-Sheva, Israel
Mark R. Tuttle Intel, Hudson, MA, USA
Many random walks are faster than one Published by ACM 2008 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 6
· Downloads (12 Months): 53
· Downloads (cumulative): 455
· Citation Count: 22

Published in:
Cover Image
 
· Proceeding
SPAA '08 Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Pages 119-128
ACM New York, NY, USA ©2008
table of contents ISBN: 978-1-59593-973-9 doi>10.1145/1378533.1378557

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