Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted Transposition

Full Text: PDFPDF Buy this ArticleBuy this Article
Author: Fred G. Gustavson Mathematical Sciences Department, IBM T.J. Watson Research Center, P.O. Box, 218, Yorktown Heights, NY
Published in:
· Journal
ACM Transactions on Mathematical Software (TOMS) TOMS Homepage archive
Volume 4 Issue 3, Sept. 1978
Pages 250-269
ACM New York, NY, USA
table of contents doi>10.1145/355791.355796
Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted Transposition Published by ACM 1978 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 14
· Downloads (12 Months): 101
· Downloads (cumulative): 2,480
· Citation Count: 18


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