Parallel algorithms for routing in non-blocking networks

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Geng Lin Department of Computer Science, The University of British Columbia, Vancouver, British Columbia V6T 1W5, Canada
Nicholas Pippenger Department of Computer Science, The University of British Columbia, Vancouver, British Columbia V6T 1W5, Canada
Published in:
· Proceeding
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Pages 272-277
ACM New York, NY, USA ©1991
table of contents ISBN:0-89791-438-4 doi>10.1145/113379.113404
Parallel algorithms for routing in non-blocking networks Published by ACM 1991 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 9
· Downloads (cumulative): 266
· Citation Count: 0


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