# Matrix multiplication

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2014

Highly Cited

2014

- ISSAC
- 2014

This paper presents a method to analyze the powers of a given trilinear form (a special kind of algebraic construction also… (More)

Is this relevant?

Highly Cited

2012

Highly Cited

2012

- IEEE 53rd Annual Symposium on Foundations of…
- 2012

Let α be the maximal value such that the product of an n × n<sup>α</sup> matrix by an n<sup>α</sup> × n matrix can be computed… (More)

Is this relevant?

Highly Cited

2009

Highly Cited

2009

- Proceedings of the Conference on High Performance…
- 2009

Sparse matrix-vector multiplication (SpMV) is of singular importance in sparse linear algebra. In contrast to the uniform… (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- 2008

The massive parallelism of graphics processing units (GPUs) offers tremendous performance in many high-performance computing… (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- ACM Trans. Math. Softw.
- 2008

We present the basic principles that underlie the high-performance implementation of the matrix-matrix multiplication that is… (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- Graphics Hardware
- 2004

Utilizing graphics hardware for general purpose numerical computations has become a topic of considerable interest. The… (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- IEEE Trans. Parallel Distrib. Syst.
- 2001

ÐIn this paper, we address the issue of implementing matrix multiplication on heterogeneous platforms. We target two different… (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- SPAA
- 1999

Alvin R. Lebeckt Matrix multiplication is an important kernel in linear algebra algorithms, and the performance of both serial… (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- J. Complexity
- 1998

First we study asymptotically fast algorithms for rectangular matrix multiplication. We begin with new algorithms for… (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- J. Complexity
- 1997

In 1969 Strassen [6] showed how to multiply a pair of 22 matrices with a bilinear algorithm using seven multiplications instead… (More)

Is this relevant?