Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted Transposition
Fred G. Gustavson · ACM Transactions on Mathematical Software · 1978
article Free Access Share on Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted Transposition Author: Fred G. Gustavson Mathematical Sciences Department, IBM T.J. Watson Research Center, P.O. Box, 218, Yorktown Heights, NY Mathematical Sciences Department, IBM T.J. Watson Research Center, P.O. Box, 218, Yorktown Heights, NYView Profile Authors Info & Claims ACM Transactions on Mathematical SoftwareVolume 4Issue 3Sept. 1978 pp 250–269https://doi.org/10.1145/355791.355796Published:01 September 1978Publication History 251citation5,639DownloadsMetricsTotal Citations251Total Downloads5,639Last 12 Months809Last 6 weeks334 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF