Deterministic rendezvous, treasure hunts and strongly universal exploration sequences

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Amnon Ta-Shma Tel Aviv University, Tel Aviv, Israel
Uri Zwick Tel Aviv University, Tel Aviv, Israel
Published in:
· Proceeding
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Pages 599-608
Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©2007
table of contents ISBN: 978-0-898716-24-5
Deterministic rendezvous, treasure hunts and strongly universal exploration sequences 2007 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 19
· Downloads (cumulative): 147
· Citation Count: 22


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