Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

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

Highly Cited

2014

Highly Cited

2014

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

Highly Cited

2009

Highly Cited

2009

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

Highly Cited

2009

Highly Cited

2009

We are witnessing a dramatic change in computer architecture due to the multicore paradigm shift, as every electronic device from… Expand

Highly Cited

2008

Highly Cited

2008

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

Highly Cited

2008

Highly Cited

2008

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

Highly Cited

2007

Highly Cited

2007

We are witnessing a dramatic change in computer architecture due to the multicore paradigm shift, as every electronic device from… Expand

Highly Cited

1999

Highly Cited

1999

In this work, we show that the standard graph-partitioning-based decomposition of sparse matrices does not reflect the actual… Expand

Highly Cited

1996

Highly Cited

1996

In the recent past, there has been considerable progress in devising algorithms for the all-pairs shortest paths (APSP) problem… Expand

Highly Cited

1990

Highly Cited

1990

We present a new method for accelerating matrix multiplication asymptotically. Thiswork builds on recent ideas of Volker Strassen… Expand

Highly Cited

1987

Highly Cited

1987

We present a new method for accelerating matrix multiplication asymptotically. This work builds on recent ideas of Volker… Expand