Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Multiplication algorithm

Known as: Multiplication algorithms, FFT multiplication, Shift and add algorithm 
A multiplication algorithm is an algorithm (or method) to multiply two numbers. Depending on the size of the numbers, different algorithms are in use… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Parallel matrix multiplication is one of the most studied fundamental problems in distributed and high performance computing. We… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
Is this relevant?
Highly Cited
2010
Highly Cited
2010
The authors describe how a simple way to split input operands allows for fast VLSI implementations of subquadratic GF (2)[ x… Expand
  • table I
  • table II
  • figure 1
Is this relevant?
Highly Cited
2009
Highly Cited
2009
  • M. Fürer
  • SIAM J. Comput.
  • 2009
  • Corpus ID: 8634548
For more than 35 years, the fastest known method for integer multiplication has been the Schonhage-Strassen algorithm running in… Expand
  • figure 1.1
  • table 6.1
Is this relevant?
Highly Cited
2007
Highly Cited
2007
This papers introduces several binary scalar multiplication algorithms with applications to cryptography. Remarkably, the… Expand
  • table 1
Is this relevant?
Highly Cited
2002
Highly Cited
2002
We present two new algorithms for solving the All Pairs Shortest Paths (APSP) problem for weighted directed graphs. Both… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1998
Highly Cited
1998
First we study asymptotically fast algorithms for rectangular matrix multiplication. We begin with new algorithms for… Expand
  • figure 1
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Montgomery multiplication methods constitute the core of modular exponentiation, the most popular operation for encrypting and… Expand
  • figure 3
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
1978
Highly Cited
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… Expand
  • table I
  • table III
  • table IV
  • figure 3
  • figure 7
Is this relevant?
Highly Cited
1974
Highly Cited
1974
From the Publisher: With this text, you gain an understanding of the fundamental concepts of algorithms, the very heart of… Expand
Is this relevant?
Highly Cited
1973
Highly Cited
1973
An algorithm for high-speed, two's complement, m-bit by n-bit parallel array multiplication is described. The two's complement… Expand
Is this relevant?