Sign In

Login

Password

Forgot Password ? Sign Up

الخوارزمية الثنائية لحساب القاسم المشترك الأكبر (Arabic Wikipedia)

Analysis of information sources in references of the Wikipedia article "الخوارزمية الثنائية لحساب القاسم المشترك الأكبر" in Arabic language version.

refsWebsite
Global rank Arabic rank
9web.archive.org
1st place
1st place
3doi.org
2nd place
5th place
2arxiv.org
69th place
207th place
1anu.edu.au
942nd place
1,235th place
1ox.ac.uk
613th place
419th place
1harvard.edu
18th place
33rd place
1issn.org
57th place
1,629th place
1godbolt.org
low place
low place
1intel.com
1,118th place
3,970th place
1lemire.me
low place
low place
1gmplib.org
low place
low place
1greyc.fr
low place
low place
1uwaterloo.ca
3,153rd place
1,558th place
1books.google.com
3rd place
8th place
1archives-ouvertes.fr
1,031st place
1,622nd place
1ams.org
451st place
1,108th place

ams.org (Global: 451st place; Arabic: 1,108th place)

mathscinet.ams.org

anu.edu.au (Global: 942nd place; Arabic: 1,235th place)

wwwmaths.anu.edu.au

  • Brent، Richard P. (13–15 سبتمبر 1999). "Twenty years' analysis of the Binary Euclidean Algorithm". 1999 Oxford-Microsoft Symposium in honour of Professor Sir Antony Hoare. Oxford. مؤرشف من الأصل في 2012-04-15.

archives-ouvertes.fr (Global: 1,031st place; Arabic: 1,622nd place)

hal.archives-ouvertes.fr

arxiv.org (Global: 69th place; Arabic: 207th place)

books.google.com (Global: 3rd place; Arabic: 8th place)

doi.org (Global: 2nd place; Arabic: 5th place)

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

godbolt.org (Global: low place; Arabic: low place)

rust.godbolt.org

greyc.fr (Global: low place; Arabic: low place)

vallee.users.greyc.fr

harvard.edu (Global: 18th place; Arabic: 33rd place)

ui.adsabs.harvard.edu

intel.com (Global: 1,118th place; Arabic: 3,970th place)

software.intel.com

issn.org (Global: 57th place; Arabic: 1,629th place)

portal.issn.org

lemire.me (Global: low place; Arabic: low place)

ox.ac.uk (Global: 613th place; Arabic: 419th place)

cs.ox.ac.uk

uwaterloo.ca (Global: 3,153rd place; Arabic: 1,558th place)

cacr.uwaterloo.ca

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

  • Brent، Richard P. (13–15 سبتمبر 1999). "Twenty years' analysis of the Binary Euclidean Algorithm". 1999 Oxford-Microsoft Symposium in honour of Professor Sir Antony Hoare. Oxford. مؤرشف من الأصل في 2012-04-15.
  • Brent، Richard P. (نوفمبر 1999). Further analysis of the Binary Euclidean algorithm (Technical report). Oxford University Computing Laboratory. arXiv:1303.2772. PRG TR-7-99. مؤرشف من الأصل في 2022-02-12.
  • Godbolt، Matt. "Compiler Explorer". مؤرشف من الأصل في 2020-12-04. اطلع عليه بتاريخ 2020-11-04.
  • Kapoor، Rajiv (21 فبراير 2009). "Avoiding the Cost of Branch Misprediction". Intel Developer Zone. مؤرشف من الأصل في 2020-11-06.
  • Lemire، Daniel (15 أكتوبر 2019). "Mispredicted branches can multiply your running times". مؤرشف من الأصل في 2020-11-12.
  • "GNU MP 6.1.2: Binary GCD". مؤرشف من الأصل في 2018-11-05.
  • Akhavi، Ali؛ Vallée، Brigitte (2000)، "Average Bit-Complexity of Euclidean Algorithms"، Proceedings ICALP'00, Lecture Notes Computer Science 1853، ص. 373–387، مؤرشف من الأصل في 2017-08-29
  • Menezes، Alfred J.؛ van Oorschot، Paul C.؛ Vanstone، Scott A. (أكتوبر 1996). "§14.4 Greatest Common Divisor Algorithms". Handbook of Applied Cryptography. CRC Press. ص. 606–610. ISBN:0-8493-8523-7. مؤرشف من الأصل (PDF) في 2021-02-03. اطلع عليه بتاريخ 2017-09-09.
  • Cohen، Henri (1993). "Chapter 1 : Fundamental Number-Theoretic Algorithms". A Course In Computational Algebraic Number Theory. كتب دراسات عليا في الرياضيات. شبغنكا. ج. 138. ص. 17–18. ISBN:0-387-55640-0. مؤرشف من الأصل في 2019-05-03.