Tight bounds for the chaining problem

Full Text: PDFPDF Buy this ArticleBuy this Article
Author: Shiva Chaudhuri Department of Computer Science, Rutgers University, New Brunswick, NJ
Published in:
· Proceeding
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Pages 62-70
ACM New York, NY, USA ©1991
table of contents ISBN:0-89791-438-4 doi>10.1145/113379.113385
Tight bounds for the chaining problem Published by ACM 1991 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 5
· Downloads (cumulative): 193
· 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