Bounds on the greedy routing algorithm for array networks

Full Text: PDFPDF Buy this ArticleBuy this Article
Author: Michael Mitzenmacher Computer Science Division, U.C. Berkeley, CA
Published in:
Cover Image
 
· Proceeding
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Pages 346-353
ACM New York, NY, USA ©1994
table of contents ISBN:0-89791-671-9 doi>10.1145/181014.181446
Bounds on the greedy routing algorithm for array networks Published by ACM 1994 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 12
· Downloads (cumulative): 225
· Citation Count: 17


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