Schönhage–Strassen algorithm (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Schönhage–Strassen algorithm" in English language version.

refsWebsite

Global rank English rank

5hal.science

low place

5doi.org

2^nd place

4semanticscholar.org

11^th place

8^th place

4researchgate.net

120^th place

125^th place

2web.archive.org

1^st place

2archive.org

6^th place

2inria.fr

4,903^rd place

3,679^th place

1arxiv.org

69^th place

59^th place

1harvard.edu

18^th place

17^th place

1usyd.edu.au

6,328^th place

4,345^th place

1tu-darmstadt.de

low place

1gmplib.org

low place

1psu.edu

207^th place

136^th place

1worldcat.org

5^th place

1acm.org

1,185^th place

840^th place

1archives-ouvertes.fr

1,031^st place

879^th place

1ams.org

451^st place

277^th place

1loria.fr

low place

1iacr.org

5,032^nd place

3,357^th place

acm.org (Global: 1,185^th place; English: 840^th place)

dl.acm.org

Fürer's algorithm has asymptotic complexity ${\textstyle O{\bigl (}n\cdot \log n\cdot 2^{\Theta (\log ^{*}n)}{\bigr )}.}$
Fürer, Martin (2007). "Faster Integer Multiplication" (PDF). Proc. STOC '07. Symposium on Theory of Computing, San Diego, Jun 2007. pp. 57–66. Archived from the original (PDF) on 2007-03-05.
Fürer, Martin (2009). "Faster Integer Multiplication". SIAM Journal on Computing. 39 (3): 979–1005. doi:10.1137/070711761. ISSN 0097-5397.

Fürer's algorithm is used in the Basic Polynomial Algebra Subprograms (BPAS) open source library. See: Covanov, Svyatoslav; Mohajerani, Davood; Moreno Maza, Marc; Wang, Linxiao (2019-07-08). "Big Prime Field FFT on Multi-core Processors". Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation (PDF). Beijing China: ACM. pp. 106–113. doi:10.1145/3326229.3326273. ISBN 978-1-4503-6084-5. S2CID 195848601.

ams.org (Global: 451^st place; English: 277^th place)

mathscinet.ams.org

Harvey, David; van der Hoeven, Joris (2021). "Integer multiplication in time $O(n\log n)$ " (PDF). Annals of Mathematics. Second Series. 193 (2): 563–617. doi:10.4007/annals.2021.193.2.4. MR 4224716. S2CID 109934776.

archive.org (Global: 6^th place; English: 6^th place)

Kleinberg, Jon; Tardos, Eva (2005). Algorithm Design (1 ed.). Pearson. p. 237. ISBN 0-321-29535-8.
Knuth, Donald E. (1997). "§ 4.3.3.C: Discrete Fourier transforms". The Art of Computer Programming. Vol. 2: Seminumerical Algorithms (3rd ed.). Addison-Wesley. pp. 305–311. ISBN 0-201-89684-2.

archives-ouvertes.fr (Global: 1,031^st place; English: 879^th place)

hal.archives-ouvertes.fr

Harvey, David; van der Hoeven, Joris (2021). "Integer multiplication in time $O(n\log n)$ " (PDF). Annals of Mathematics. Second Series. 193 (2): 563–617. doi:10.4007/annals.2021.193.2.4. MR 4224716. S2CID 109934776.

arxiv.org (Global: 69^th place; English: 59^th place)

Karatsuba multiplication has asymptotic complexity of about $O(n^{1.58})$ and Toom–Cook multiplication has asymptotic complexity of about $O(n^{1.46}).$

Van Meter, Rodney; Itoh, Kohei M. (2005). "Fast Quantum Modular Exponentiation". Physical Review. 71 (5): 052320. arXiv:quant-ph/0408006. Bibcode:2005PhRvA..71e2320V. doi:10.1103/PhysRevA.71.052320. S2CID 14983569.{{cite journal}}: CS1 maint: article number as page number (link)

A discussion of practical crossover points between various algorithms can be found in: Overview of Magma V2.9 Features, arithmetic section Archived 2006-08-20 at the Wayback Machine

Luis Carlos Coronado García, "Can Schönhage multiplication speed up the RSA encryption or decryption? Archived", University of Technology, Darmstadt (2005)

The GNU Multi-Precision Library uses it for values of at least 1728 to 7808 64-bit words (33,000 to 150,000 decimal digits), depending on architecture. See:

"FFT Multiplication (GNU MP 6.2.1)". gmplib.org. Retrieved 2021-07-20.

"MUL_FFT_THRESHOLD". GMP developers' corner. Archived from the original on 24 November 2010. Retrieved 3 November 2011.

"MUL_FFT_THRESHOLD". gmplib.org. Retrieved 2021-07-20.

doi.org (Global: 2^nd place; English: 2^nd place)

doi.org

Schönhage, Arnold; Strassen, Volker (1971). "Schnelle Multiplikation großer Zahlen" [Fast multiplication of large numbers]. Computing (in German). 7 (3–4): 281–292. doi:10.1007/BF02242355. S2CID 9738629.
Karatsuba multiplication has asymptotic complexity of about $O(n^{1.58})$ and Toom–Cook multiplication has asymptotic complexity of about $O(n^{1.46}).$

Van Meter, Rodney; Itoh, Kohei M. (2005). "Fast Quantum Modular Exponentiation". Physical Review. 71 (5): 052320. arXiv:quant-ph/0408006. Bibcode:2005PhRvA..71e2320V. doi:10.1103/PhysRevA.71.052320. S2CID 14983569.{{cite journal}}: CS1 maint: article number as page number (link)

A discussion of practical crossover points between various algorithms can be found in: Overview of Magma V2.9 Features, arithmetic section Archived 2006-08-20 at the Wayback Machine

Luis Carlos Coronado García, "Can Schönhage multiplication speed up the RSA encryption or decryption? Archived", University of Technology, Darmstadt (2005)

The GNU Multi-Precision Library uses it for values of at least 1728 to 7808 64-bit words (33,000 to 150,000 decimal digits), depending on architecture. See:

"FFT Multiplication (GNU MP 6.2.1)". gmplib.org. Retrieved 2021-07-20.

"MUL_FFT_THRESHOLD". GMP developers' corner. Archived from the original on 24 November 2010. Retrieved 3 November 2011.

"MUL_FFT_THRESHOLD". gmplib.org. Retrieved 2021-07-20.
Fürer's algorithm has asymptotic complexity ${\textstyle O{\bigl (}n\cdot \log n\cdot 2^{\Theta (\log ^{*}n)}{\bigr )}.}$
Fürer, Martin (2007). "Faster Integer Multiplication" (PDF). Proc. STOC '07. Symposium on Theory of Computing, San Diego, Jun 2007. pp. 57–66. Archived from the original (PDF) on 2007-03-05.
Fürer, Martin (2009). "Faster Integer Multiplication". SIAM Journal on Computing. 39 (3): 979–1005. doi:10.1137/070711761. ISSN 0097-5397.

Fürer's algorithm is used in the Basic Polynomial Algebra Subprograms (BPAS) open source library. See: Covanov, Svyatoslav; Mohajerani, Davood; Moreno Maza, Marc; Wang, Linxiao (2019-07-08). "Big Prime Field FFT on Multi-core Processors". Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation (PDF). Beijing China: ACM. pp. 106–113. doi:10.1145/3326229.3326273. ISBN 978-1-4503-6084-5. S2CID 195848601.
Harvey, David; van der Hoeven, Joris (2021). "Integer multiplication in time $O(n\log n)$ " (PDF). Annals of Mathematics. Second Series. 193 (2): 563–617. doi:10.4007/annals.2021.193.2.4. MR 4224716. S2CID 109934776.

dx.doi.org

Fürer's algorithm has asymptotic complexity ${\textstyle O{\bigl (}n\cdot \log n\cdot 2^{\Theta (\log ^{*}n)}{\bigr )}.}$
Fürer, Martin (2007). "Faster Integer Multiplication" (PDF). Proc. STOC '07. Symposium on Theory of Computing, San Diego, Jun 2007. pp. 57–66. Archived from the original (PDF) on 2007-03-05.
Fürer, Martin (2009). "Faster Integer Multiplication". SIAM Journal on Computing. 39 (3): 979–1005. doi:10.1137/070711761. ISSN 0097-5397.

Fürer's algorithm is used in the Basic Polynomial Algebra Subprograms (BPAS) open source library. See: Covanov, Svyatoslav; Mohajerani, Davood; Moreno Maza, Marc; Wang, Linxiao (2019-07-08). "Big Prime Field FFT on Multi-core Processors". Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation (PDF). Beijing China: ACM. pp. 106–113. doi:10.1145/3326229.3326273. ISBN 978-1-4503-6084-5. S2CID 195848601.

gmplib.org (Global: low place; English: low place)

Karatsuba multiplication has asymptotic complexity of about $O(n^{1.58})$ and Toom–Cook multiplication has asymptotic complexity of about $O(n^{1.46}).$

Van Meter, Rodney; Itoh, Kohei M. (2005). "Fast Quantum Modular Exponentiation". Physical Review. 71 (5): 052320. arXiv:quant-ph/0408006. Bibcode:2005PhRvA..71e2320V. doi:10.1103/PhysRevA.71.052320. S2CID 14983569.{{cite journal}}: CS1 maint: article number as page number (link)

A discussion of practical crossover points between various algorithms can be found in: Overview of Magma V2.9 Features, arithmetic section Archived 2006-08-20 at the Wayback Machine

Luis Carlos Coronado García, "Can Schönhage multiplication speed up the RSA encryption or decryption? Archived", University of Technology, Darmstadt (2005)

The GNU Multi-Precision Library uses it for values of at least 1728 to 7808 64-bit words (33,000 to 150,000 decimal digits), depending on architecture. See:

"FFT Multiplication (GNU MP 6.2.1)". gmplib.org. Retrieved 2021-07-20.

"MUL_FFT_THRESHOLD". GMP developers' corner. Archived from the original on 24 November 2010. Retrieved 3 November 2011.

"MUL_FFT_THRESHOLD". gmplib.org. Retrieved 2021-07-20.

hal.science (Global: low place; English: low place)

inria.hal.science

Gaudry, Pierrick; Alexander, Kruppa; Paul, Zimmermann (2007). "A GMP-based implementation of Schönhage-Strassen's large integer multiplication algorithm" (PDF). p. 6.
Gaudry, Pierrick; Kruppa, Alexander; Zimmermann, Paul (2007). "A GMP-based Implementation of Schönhage-Strassen's Large Integer Multiplication Algorithm" (PDF). p. 2.
Gaudry, Pierrick; Kruppa, Alexander; Zimmermann, Paul (2007). "A GMP-based implementation of Schönhage-Strassen's large integer multiplication algorithm" (PDF). p. 7.
Gaudry, Pierrick; Kruppa, Alexander; Zimmermann, Paul (2007). "A GMP-based implementation of Schönhage-Strassen's large integer multiplication algorithm" (PDF). p. 6.
Gaudry, Pierrick; Kruppa, Alexander; Zimmermann, Paul (2007). "A GMP-based implementation of Schönhage-Strassen's large integer multiplication algorithm" (PDF). p. 6.

harvard.edu (Global: 18^th place; English: 17^th place)

ui.adsabs.harvard.edu

Karatsuba multiplication has asymptotic complexity of about $O(n^{1.58})$ and Toom–Cook multiplication has asymptotic complexity of about $O(n^{1.46}).$

Van Meter, Rodney; Itoh, Kohei M. (2005). "Fast Quantum Modular Exponentiation". Physical Review. 71 (5): 052320. arXiv:quant-ph/0408006. Bibcode:2005PhRvA..71e2320V. doi:10.1103/PhysRevA.71.052320. S2CID 14983569.{{cite journal}}: CS1 maint: article number as page number (link)

A discussion of practical crossover points between various algorithms can be found in: Overview of Magma V2.9 Features, arithmetic section Archived 2006-08-20 at the Wayback Machine

Luis Carlos Coronado García, "Can Schönhage multiplication speed up the RSA encryption or decryption? Archived", University of Technology, Darmstadt (2005)

The GNU Multi-Precision Library uses it for values of at least 1728 to 7808 64-bit words (33,000 to 150,000 decimal digits), depending on architecture. See:

"FFT Multiplication (GNU MP 6.2.1)". gmplib.org. Retrieved 2021-07-20.

"MUL_FFT_THRESHOLD". GMP developers' corner. Archived from the original on 24 November 2010. Retrieved 3 November 2011.

"MUL_FFT_THRESHOLD". gmplib.org. Retrieved 2021-07-20.

iacr.org (Global: 5,032^nd place; English: 3,357^th place)

eprint.iacr.org

Becker, Hanno; Hwang, Vincent; J. Kannwischer, Matthias; Panny, Lorenz (2022). "Efficient Multiplication of Somewhat Small Integers using Number-Theoretic Transforms" (PDF).

inria.fr (Global: 4,903^rd place; English: 3,679^th place)

hal.inria.fr

Fürer's algorithm has asymptotic complexity ${\textstyle O{\bigl (}n\cdot \log n\cdot 2^{\Theta (\log ^{*}n)}{\bigr )}.}$
Fürer, Martin (2007). "Faster Integer Multiplication" (PDF). Proc. STOC '07. Symposium on Theory of Computing, San Diego, Jun 2007. pp. 57–66. Archived from the original (PDF) on 2007-03-05.
Fürer, Martin (2009). "Faster Integer Multiplication". SIAM Journal on Computing. 39 (3): 979–1005. doi:10.1137/070711761. ISSN 0097-5397.

Fürer's algorithm is used in the Basic Polynomial Algebra Subprograms (BPAS) open source library. See: Covanov, Svyatoslav; Mohajerani, Davood; Moreno Maza, Marc; Wang, Linxiao (2019-07-08). "Big Prime Field FFT on Multi-core Processors". Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation (PDF). Beijing China: ACM. pp. 106–113. doi:10.1145/3326229.3326273. ISBN 978-1-4503-6084-5. S2CID 195848601.

gitlab.inria.fr

This method is used in INRIA's ECM library.

loria.fr (Global: low place; English: low place)

members.loria.fr

"ECMNET". members.loria.fr. Retrieved 2023-04-09.

psu.edu (Global: 207^th place; English: 136^th place)

cse.psu.edu

Fürer's algorithm has asymptotic complexity ${\textstyle O{\bigl (}n\cdot \log n\cdot 2^{\Theta (\log ^{*}n)}{\bigr )}.}$
Fürer, Martin (2007). "Faster Integer Multiplication" (PDF). Proc. STOC '07. Symposium on Theory of Computing, San Diego, Jun 2007. pp. 57–66. Archived from the original (PDF) on 2007-03-05.
Fürer, Martin (2009). "Faster Integer Multiplication". SIAM Journal on Computing. 39 (3): 979–1005. doi:10.1137/070711761. ISSN 0097-5397.

Fürer's algorithm is used in the Basic Polynomial Algebra Subprograms (BPAS) open source library. See: Covanov, Svyatoslav; Mohajerani, Davood; Moreno Maza, Marc; Wang, Linxiao (2019-07-08). "Big Prime Field FFT on Multi-core Processors". Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation (PDF). Beijing China: ACM. pp. 106–113. doi:10.1145/3326229.3326273. ISBN 978-1-4503-6084-5. S2CID 195848601.

researchgate.net (Global: 120^th place; English: 125^th place)

Lüders, Christoph (2014). "Fast Multiplication of Large Integers: Implementation and Analysis of the DKSS Algorithm". p. 26.
S. Dimitrov, Vassil; V. Cooklev, Todor; D. Donevsky, Borislav (1994). "Generalized Fermat-Mersenne Number Theoretic Transform". p. 2.
S. Dimitrov, Vassil; V. Cooklev, Todor; D. Donevsky, Borislav (1994). "Generalized Fermat-Mersenne Number Theoretic Transform". p. 3.
Lüders, Christoph (2014). "Fast Multiplication of Large Integers: Implementation and Analysis of the DKSS Algorithm". p. 28.

semanticscholar.org (Global: 11^th place; English: 8^th place)

api.semanticscholar.org

Schönhage, Arnold; Strassen, Volker (1971). "Schnelle Multiplikation großer Zahlen" [Fast multiplication of large numbers]. Computing (in German). 7 (3–4): 281–292. doi:10.1007/BF02242355. S2CID 9738629.
Karatsuba multiplication has asymptotic complexity of about $O(n^{1.58})$ and Toom–Cook multiplication has asymptotic complexity of about $O(n^{1.46}).$

Van Meter, Rodney; Itoh, Kohei M. (2005). "Fast Quantum Modular Exponentiation". Physical Review. 71 (5): 052320. arXiv:quant-ph/0408006. Bibcode:2005PhRvA..71e2320V. doi:10.1103/PhysRevA.71.052320. S2CID 14983569.{{cite journal}}: CS1 maint: article number as page number (link)

A discussion of practical crossover points between various algorithms can be found in: Overview of Magma V2.9 Features, arithmetic section Archived 2006-08-20 at the Wayback Machine

Luis Carlos Coronado García, "Can Schönhage multiplication speed up the RSA encryption or decryption? Archived", University of Technology, Darmstadt (2005)

The GNU Multi-Precision Library uses it for values of at least 1728 to 7808 64-bit words (33,000 to 150,000 decimal digits), depending on architecture. See:

"FFT Multiplication (GNU MP 6.2.1)". gmplib.org. Retrieved 2021-07-20.

"MUL_FFT_THRESHOLD". GMP developers' corner. Archived from the original on 24 November 2010. Retrieved 3 November 2011.

"MUL_FFT_THRESHOLD". gmplib.org. Retrieved 2021-07-20.
Fürer's algorithm has asymptotic complexity ${\textstyle O{\bigl (}n\cdot \log n\cdot 2^{\Theta (\log ^{*}n)}{\bigr )}.}$
Fürer, Martin (2007). "Faster Integer Multiplication" (PDF). Proc. STOC '07. Symposium on Theory of Computing, San Diego, Jun 2007. pp. 57–66. Archived from the original (PDF) on 2007-03-05.
Fürer, Martin (2009). "Faster Integer Multiplication". SIAM Journal on Computing. 39 (3): 979–1005. doi:10.1137/070711761. ISSN 0097-5397.

Fürer's algorithm is used in the Basic Polynomial Algebra Subprograms (BPAS) open source library. See: Covanov, Svyatoslav; Mohajerani, Davood; Moreno Maza, Marc; Wang, Linxiao (2019-07-08). "Big Prime Field FFT on Multi-core Processors". Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation (PDF). Beijing China: ACM. pp. 106–113. doi:10.1145/3326229.3326273. ISBN 978-1-4503-6084-5. S2CID 195848601.
Harvey, David; van der Hoeven, Joris (2021). "Integer multiplication in time $O(n\log n)$ " (PDF). Annals of Mathematics. Second Series. 193 (2): 563–617. doi:10.4007/annals.2021.193.2.4. MR 4224716. S2CID 109934776.

tu-darmstadt.de (Global: low place; English: low place)

cdc.informatik.tu-darmstadt.de

Karatsuba multiplication has asymptotic complexity of about $O(n^{1.58})$ and Toom–Cook multiplication has asymptotic complexity of about $O(n^{1.46}).$

Van Meter, Rodney; Itoh, Kohei M. (2005). "Fast Quantum Modular Exponentiation". Physical Review. 71 (5): 052320. arXiv:quant-ph/0408006. Bibcode:2005PhRvA..71e2320V. doi:10.1103/PhysRevA.71.052320. S2CID 14983569.{{cite journal}}: CS1 maint: article number as page number (link)

A discussion of practical crossover points between various algorithms can be found in: Overview of Magma V2.9 Features, arithmetic section Archived 2006-08-20 at the Wayback Machine

Luis Carlos Coronado García, "Can Schönhage multiplication speed up the RSA encryption or decryption? Archived", University of Technology, Darmstadt (2005)

The GNU Multi-Precision Library uses it for values of at least 1728 to 7808 64-bit words (33,000 to 150,000 decimal digits), depending on architecture. See:

"FFT Multiplication (GNU MP 6.2.1)". gmplib.org. Retrieved 2021-07-20.

"MUL_FFT_THRESHOLD". GMP developers' corner. Archived from the original on 24 November 2010. Retrieved 3 November 2011.

"MUL_FFT_THRESHOLD". gmplib.org. Retrieved 2021-07-20.

usyd.edu.au (Global: 6,328^th place; English: 4,345^th place)

magma.maths.usyd.edu.au

Karatsuba multiplication has asymptotic complexity of about $O(n^{1.58})$ and Toom–Cook multiplication has asymptotic complexity of about $O(n^{1.46}).$

Van Meter, Rodney; Itoh, Kohei M. (2005). "Fast Quantum Modular Exponentiation". Physical Review. 71 (5): 052320. arXiv:quant-ph/0408006. Bibcode:2005PhRvA..71e2320V. doi:10.1103/PhysRevA.71.052320. S2CID 14983569.{{cite journal}}: CS1 maint: article number as page number (link)

A discussion of practical crossover points between various algorithms can be found in: Overview of Magma V2.9 Features, arithmetic section Archived 2006-08-20 at the Wayback Machine

Luis Carlos Coronado García, "Can Schönhage multiplication speed up the RSA encryption or decryption? Archived", University of Technology, Darmstadt (2005)

The GNU Multi-Precision Library uses it for values of at least 1728 to 7808 64-bit words (33,000 to 150,000 decimal digits), depending on architecture. See:

"FFT Multiplication (GNU MP 6.2.1)". gmplib.org. Retrieved 2021-07-20.

"MUL_FFT_THRESHOLD". GMP developers' corner. Archived from the original on 24 November 2010. Retrieved 3 November 2011.

"MUL_FFT_THRESHOLD". gmplib.org. Retrieved 2021-07-20.

web.archive.org (Global: 1^st place; English: 1^st place)

Karatsuba multiplication has asymptotic complexity of about $O(n^{1.58})$ and Toom–Cook multiplication has asymptotic complexity of about $O(n^{1.46}).$

Van Meter, Rodney; Itoh, Kohei M. (2005). "Fast Quantum Modular Exponentiation". Physical Review. 71 (5): 052320. arXiv:quant-ph/0408006. Bibcode:2005PhRvA..71e2320V. doi:10.1103/PhysRevA.71.052320. S2CID 14983569.{{cite journal}}: CS1 maint: article number as page number (link)

A discussion of practical crossover points between various algorithms can be found in: Overview of Magma V2.9 Features, arithmetic section Archived 2006-08-20 at the Wayback Machine

Luis Carlos Coronado García, "Can Schönhage multiplication speed up the RSA encryption or decryption? Archived", University of Technology, Darmstadt (2005)

The GNU Multi-Precision Library uses it for values of at least 1728 to 7808 64-bit words (33,000 to 150,000 decimal digits), depending on architecture. See:

"FFT Multiplication (GNU MP 6.2.1)". gmplib.org. Retrieved 2021-07-20.

"MUL_FFT_THRESHOLD". GMP developers' corner. Archived from the original on 24 November 2010. Retrieved 3 November 2011.

"MUL_FFT_THRESHOLD". gmplib.org. Retrieved 2021-07-20.
Fürer's algorithm has asymptotic complexity ${\textstyle O{\bigl (}n\cdot \log n\cdot 2^{\Theta (\log ^{*}n)}{\bigr )}.}$
Fürer, Martin (2007). "Faster Integer Multiplication" (PDF). Proc. STOC '07. Symposium on Theory of Computing, San Diego, Jun 2007. pp. 57–66. Archived from the original (PDF) on 2007-03-05.
Fürer, Martin (2009). "Faster Integer Multiplication". SIAM Journal on Computing. 39 (3): 979–1005. doi:10.1137/070711761. ISSN 0097-5397.

Fürer's algorithm is used in the Basic Polynomial Algebra Subprograms (BPAS) open source library. See: Covanov, Svyatoslav; Mohajerani, Davood; Moreno Maza, Marc; Wang, Linxiao (2019-07-08). "Big Prime Field FFT on Multi-core Processors". Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation (PDF). Beijing China: ACM. pp. 106–113. doi:10.1145/3326229.3326273. ISBN 978-1-4503-6084-5. S2CID 195848601.

worldcat.org (Global: 5^th place; English: 5^th place)

search.worldcat.org

Fürer's algorithm has asymptotic complexity ${\textstyle O{\bigl (}n\cdot \log n\cdot 2^{\Theta (\log ^{*}n)}{\bigr )}.}$
Fürer, Martin (2007). "Faster Integer Multiplication" (PDF). Proc. STOC '07. Symposium on Theory of Computing, San Diego, Jun 2007. pp. 57–66. Archived from the original (PDF) on 2007-03-05.
Fürer, Martin (2009). "Faster Integer Multiplication". SIAM Journal on Computing. 39 (3): 979–1005. doi:10.1137/070711761. ISSN 0097-5397.

Fürer's algorithm is used in the Basic Polynomial Algebra Subprograms (BPAS) open source library. See: Covanov, Svyatoslav; Mohajerani, Davood; Moreno Maza, Marc; Wang, Linxiao (2019-07-08). "Big Prime Field FFT on Multi-core Processors". Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation (PDF). Beijing China: ACM. pp. 106–113. doi:10.1145/3326229.3326273. ISBN 978-1-4503-6084-5. S2CID 195848601.

Schönhage–Strassen algorithm (English Wikipedia)

acm.org (Global: 1,185th place; English: 840th place)

dl.acm.org

ams.org (Global: 451st place; English: 277th place)

mathscinet.ams.org

archive.org (Global: 6th place; English: 6th place)

archives-ouvertes.fr (Global: 1,031st place; English: 879th place)

hal.archives-ouvertes.fr

arxiv.org (Global: 69th place; English: 59th place)

doi.org (Global: 2nd place; English: 2nd place)

doi.org

dx.doi.org

gmplib.org (Global: low place; English: low place)

hal.science (Global: low place; English: low place)

inria.hal.science

harvard.edu (Global: 18th place; English: 17th place)

ui.adsabs.harvard.edu

iacr.org (Global: 5,032nd place; English: 3,357th place)

eprint.iacr.org

inria.fr (Global: 4,903rd place; English: 3,679th place)

hal.inria.fr

gitlab.inria.fr

loria.fr (Global: low place; English: low place)

members.loria.fr

psu.edu (Global: 207th place; English: 136th place)

cse.psu.edu

researchgate.net (Global: 120th place; English: 125th place)

semanticscholar.org (Global: 11th place; English: 8th place)

api.semanticscholar.org

tu-darmstadt.de (Global: low place; English: low place)

cdc.informatik.tu-darmstadt.de

usyd.edu.au (Global: 6,328th place; English: 4,345th place)

magma.maths.usyd.edu.au

web.archive.org (Global: 1st place; English: 1st place)

worldcat.org (Global: 5th place; English: 5th place)

search.worldcat.org

acm.org (Global: 1,185^th place; English: 840^th place)

ams.org (Global: 451^st place; English: 277^th place)

archive.org (Global: 6^th place; English: 6^th place)

archives-ouvertes.fr (Global: 1,031^st place; English: 879^th place)

arxiv.org (Global: 69^th place; English: 59^th place)

doi.org (Global: 2^nd place; English: 2^nd place)

harvard.edu (Global: 18^th place; English: 17^th place)

iacr.org (Global: 5,032^nd place; English: 3,357^th place)

inria.fr (Global: 4,903^rd place; English: 3,679^th place)

psu.edu (Global: 207^th place; English: 136^th place)

researchgate.net (Global: 120^th place; English: 125^th place)

semanticscholar.org (Global: 11^th place; English: 8^th place)

usyd.edu.au (Global: 6,328^th place; English: 4,345^th place)

web.archive.org (Global: 1^st place; English: 1^st place)

worldcat.org (Global: 5^th place; English: 5^th place)