Algoritmul Fürer (Romanian Wikipedia)
Analysis of information sources in references of the Wikipedia article "Algoritmul Fürer" in Romanian language version.
refsWebsite
Global rank
Romanian rank
1st place
1st place
1,031st place
6,454th place
6,413th place
low place
5th place
11th place
4,584th place
6,640th place
archives-ouvertes.fr (Global: 1,031st place; Romanian: 6,454th place)
hal.archives-ouvertes.fr
- en Harvey, David; Van Der Hoeven, Joris (). Integer multiplication in time O(n log n).
arxiv.org (Global: 69th place; Romanian: 132nd place)
- en A. De, C. Saha, P. Kurur and R. Saptharishi (2008). "Fast integer multiplication using modular arithmetic" Proceedings of the 40th annual ACM Symposium on Theory of Computing (STOC), 499–506, New York, NY, 2008, and SIAM Journal on Computing, Vol. 42 Issue 2, 685–699, 2013. arΧiv:0801.1416
- en D. Harvey, J. van der Hoeven, G. Lecerf (2015), "Even faster integer multiplication", February 2015. arΧiv:1407.3360
- en Covanov, S.; Thomé, E. (). „Fast Arithmetic for Faster Integer Multiplication”. arXiv:1502.02800v1
. Published as Covanov & Thomé (2019) - en Covanov, Svyatoslav; Thomé, Emmanuel (). „Fast Integer Multiplication Using Generalized Fermat Primes”. Mathematics of Computation. 88: 1449–1477. arXiv:1502.02800 . doi:10.1090/mcom/3367.
- en D. Harvey and J. van der Hoeven (2018). "Faster integer multiplication using short lattice vectors", February 2018. arΧiv:1802.07932
doi.org (Global: 2nd place; Romanian: 3rd place)
- de Schönhage, A.; Strassen, V. (). „Schnelle Multiplikation großer Zahlen”. Computing. 7 (3–4): 281–292. doi:10.1007/BF02242355.
- en Covanov, Svyatoslav; Thomé, Emmanuel (). „Fast Integer Multiplication Using Generalized Fermat Primes”. Mathematics of Computation. 88: 1449–1477. arXiv:1502.02800 . doi:10.1090/mcom/3367.
quantamagazine.org (Global: 6,413th place; Romanian: low place)
- en Hartnett, Kevin (). „Mathematicians Discover the Perfect Way to Multiply”. Wired. ISSN 1059-1028. Accesat în .
unsw.edu.au (Global: 4,584th place; Romanian: 6,640th place)
newsroom.unsw.edu.au
- en Gilbert, Lachlan (). „Maths whiz solves 48-year-old multiplication problem”. UNSW. Accesat în .
web.archive.org (Global: 1st place; Romanian: 1st place)
- M. Fürer (2007), "Faster Integer Multiplication" Proceedings of the 39th annual ACM Symposium on Theory of Computing (STOC), 55–67, San Diego, CA, June 11–13, 2007, and SIAM Journal on Computing, Vol. 39 Issue 3, 979–1005, 2009.
- en Lüders, Christoph (). Implementation of the DKSS Algorithm for Multiplication of Large Numbers (PDF). International Symposium on Symbolic and Algebraic Computation. pp. 267–274. Arhivat din original (pdf) la . Accesat în .
worldcat.org (Global: 5th place; Romanian: 11th place)
- en Hartnett, Kevin (). „Mathematicians Discover the Perfect Way to Multiply”. Wired. ISSN 1059-1028. Accesat în .
wrogn.com (Global: low place; Romanian: low place)
- en Lüders, Christoph (). Implementation of the DKSS Algorithm for Multiplication of Large Numbers (PDF). International Symposium on Symbolic and Algebraic Computation. pp. 267–274. Arhivat din original (pdf) la . Accesat în .