Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 410

The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.

Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted Transposition

Gustavson, Fred G.·1978·ACM Transactions on Mathematical Software

Abstract

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

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/355791.355796

Cites

4 of 4 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 4 references

Cited by

See all 410

Metadata

Authors
Gustavson, F. G.
Venue
ACM Transactions on Mathematical Software
Published
1978-09
Volume
4
Issue
3
Pages
250-269
ISSN
  • 0098-3500 (ISSN-L)
  • 1557-7295
OpenAlex
W2089437293
Cited by
410
References
4
FWCI
2.77
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted Transposition. https://app.cochat.ai/papers/10.1145/355791.355796
The paper
Gustavson, F. G. (1978). Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted Transposition. ACM Transactions on Mathematical Software. https://doi.org/10.1145/355791.355796

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.