# Strassen algorithm

## Papers overview

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

2018

2018

- SIAM J. Scientific Computing
- 2018

Tensor contraction (TC) is an important computational kernel widely used in numerous applications. It is a multi-dimensional… (More)

Is this relevant?

2016

2016

- SC16: International Conference for High…
- 2016

We dispel with “street wisdom” regarding the practical implementation of Strassen's algorithm for matrix-matrix multiplication… (More)

Is this relevant?

2016

2016

- ArXiv
- 2016

We dispel with “street wisdom” regarding the practical implementation of Strassen’s algorithm for matrix-matrix multiplication… (More)

Is this relevant?

Highly Cited

2012

Highly Cited

2012

- SPAA
- 2012

Parallel matrix multiplication is one of the most studied fundamental problems in distributed and high performance computing. We… (More)

Is this relevant?

2006

2006

- 2006

This paper studies Strassen’s matrix multiplication algorithm by implementing it in a variety of methods: sequential, workflow… (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- Proceedings of the IEEE/ACM SC98 Conference
- 1998

Strassen's algorithm for matrix multiplication gains its lower arithmetic complexity at the expense of reduced locality of… (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- Proceedings of the ACM/IEEE Conference on…
- 1996

In this paper we report on the development of an efficient and portable implementation of Strassen's matrix multiplication… (More)

Is this relevant?

1995

1995

- 1995

An eecient BSP realisation of Strassen's matrix multiplication algorithm is described. 1 Strassen's Algorithm Let A and B be two… (More)

Is this relevant?

1991

1991

- The Journal of Supercomputing
- 1991

Strassen's algorithm for fast matrix-matrix multiplication has been implemented for matrices of arbitrary shapes on the CRAY-2… (More)

Is this relevant?

Highly Cited

1974

Highly Cited

1974

- 1974

Addison-Wesley Pub. Co., 1974, , 470 pages. With this text, you gain an understanding of the fundamental concepts of algorithms… (More)

Is this relevant?