# Multiplication algorithm

## Papers overview

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

Highly Cited

2009

Highly Cited

2009

- SIAM J. Comput.
- 2009

For more than 35 years, the fastest known method for integer multiplication has been the SchÃ¶nhage-Strassen algorithm running inâ€¦Â (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- IEEE Trans. Computers
- 1998

We present a new RNS modular multiplication for very large operands. The algorithm is based on Montgomeryâ€™s method adapted toâ€¦Â (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- IEEE Micro
- 1996

This paper discusses several Montgomery multiplication algorithms, two of which have been proposed before. We describe threeâ€¦Â (More)

Is this relevant?

Highly Cited

1993

Highly Cited

1993

- IEEE Trans. Computers
- 1993

Hardware is described for implementing the fast modular multiplication algorithm of P. L. Montgomery. Comparison with previousâ€¦Â (More)

Is this relevant?

Highly Cited

1993

Highly Cited

1993

- Concurrency - Practice and Experience
- 1993

This paper describes the Parallel Universal Matrix Multiplication Algorithms (PUMMA) on distributed memory concurrent computersâ€¦Â (More)

Is this relevant?

Highly Cited

1985

Highly Cited

1985

- IEEE Transactions on Computers
- 1985

Finite field arithmetic logic is central in the implementation of Reed-Solomon coders and in some cryptographic algorithms. Thereâ€¦Â (More)

Is this relevant?

Highly Cited

1985

Highly Cited

1985

- IEEE Transactions on Computers
- 1985

A high-speed VLSI multiplication algorithm internally using redundant binary representation is proposed. In n bit binary integerâ€¦Â (More)

Is this relevant?

Highly Cited

1978

Highly Cited

1978

- ACM Trans. Math. Softw.
- 1978

Let A and B be two sparse matrices whose orders are p by q and q by r. Their product C -A B requires N nontrlvial multiplicationsâ€¦Â (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?

Highly Cited

1973

Highly Cited

1973

- IEEE Transactions on Computers
- 1973

An algorithm for high-speed, two's complement, m-bit by n-bit parallel array multiplication is described. The two's complementâ€¦Â (More)

Is this relevant?