SIGN IN
SIGN UP
Robust algorithms for packet routing in a mesh
Full Text:
PDF
Buy this Article
Author:
P. Raghavan
IBM Research Division, T.J. Watson Research Center, Yorktown Heights, NY
Published in:
· Proceeding
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Pages 344-350
ACM
New York, NY
, USA
©1989
table of contents
ISBN:0-89791-323-X
doi>
10.1145/72935.72972
1989 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 7
· Downloads (cumulative): 98
· Citation Count: 10
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SPAA '13
Share:
|
Tags:
algorithms
array and vector processors
design
permutations and combinations
routing and layout
theory
unbounded-action devices
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder