SIGN IN
SIGN UP
Bounds to the throughput of an interconnection network
Author:
Luděk Kučera
Published in:
· Proceeding
SPAA '97
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Pages 139-148
ACM
New York, NY
, USA
©1997
table of contents
ISBN:0-89791-890-8
doi>
10.1145/258492.258506
1997 Article
Bibliometrics
· Downloads (6 Weeks): n/a
· Downloads (12 Months): n/a
· Downloads (cumulative): n/a
· Citation Count: 2
Tools and Resources
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SPAA '13
Share:
|
Tags:
algorithm design and analysis
algorithms
design
experimentation
interconnection architectures
measurement
performance
reliability
theory
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