Skip to search formSkip to main contentSkip to account menuSemantic Scholar Semantic Scholar's Logo Search 208,120,168 papers from all fields of science

Search

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…

Highly Cited

2009

Highly Cited

2009

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

Highly Cited

2008

Highly Cited

2008

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

Highly Cited

2008

Highly Cited

2008

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

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…

Highly Cited

2004

Highly Cited

2004

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

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…

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…

Highly Cited

1989

Highly Cited

1989

The author presents an algorithm for solving linear programming problems that requires O((m+n)/sup 1.5/nL) arithmetic operations…

Highly Cited

1987

Highly Cited

1987

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