Algoritmul lui Euclid (Romanian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Algoritmul lui Euclid" in Romanian language version.

refsWebsite

Global rank Romanian rank

16doi.org

2^nd place

3^rd place

3loc.gov

70^th place

73^rd place

1wolfram.com

513^th place

306^th place

1sciencenews.org

3,410^th place

2,799^th place

1colorado.edu

2,526^th place

1,180^th place

1liu.se

9,195^th place

low place

1springerlink.com

2,569^th place

698^th place

1queensu.ca

6,111^th place

low place

1arxiv.org

69^th place

132^nd place

1projecteuclid.org

3,707^th place

8,468^th place

arxiv.org

Yamada Y (2007). „Generalized rational blow-down, torus knots, and Euclidean algorithm”. arXiv:0708.2316v1. Legătură externa în |title= (ajutor)

colorado.edu

amath.colorado.edu

Cipra BA (16 mai 2000). „The Best of the 20th Century: Editors Name Top 10 Algorithms”. SIAM News. Society for Industrial and Applied Mathematics. 33 (4). Legătură externa în |title= (ajutor)

doi.org

von Fritz K (1945). „The Discovery of Incommensurability by Hippasus of Metapontum”. Ann. Math. 46: 242–264. doi:10.2307/1969021.
engleză {{{1}}}Cole AJ, Davie AJT (1969). „A game based on the Euclidean algorithm and a winning strategy for it”. Math. Gaz. 53: 354–357. doi:10.2307/3612461.
Dixon JD (1981). „Asymptotically fast factorization of integers”. Math. Comput. 36: 255–260. doi:10.2307/2007743.
Lenstra Jr. HW (1987). „Factoring integers with elliptic curves”. Annals of Mathematics. 126: 649–673. doi:10.2307/1971363.
Grossman H (1924). „On the Number of Divisions in Finding a G.C.D”. The American Mathematical Monthly. 31: 443. doi:10.2307/2298146.
Knuth DE (1976). „Evaluation of Porter's Constant”. Computers and Mathematics with Applications. 2: 137–139. doi:10.1016/0898-1221(76)90025-0.
Dixon JD (1970). „The Number of Steps in the Euclidean Algorithm”. J. Number Theory. 2: 414–422. doi:10.1016/0022-314X(70)90044-2.
Norton GH (1990). „On the Asymptotic Analysis of the Euclidean Algorithm”. Journal of Symbolic Computation. 10: 53–58. doi:10.1016/S0747-7171(08)80036-3.
Stein J (1967). „Computational problems associated with Racah algebra”. Journal of Computational Physics. 1: 397–405. doi:10.1016/0021-9991(67)90047-2.
Lehmer DH (1938). „Euclid's Algorithm for Large Numbers”. The American Mathematical Monthly. 45: 227–233. doi:10.2307/2302607.
Sorenson J (1994). „Two fast GCD algorithms”. J. Algorithms. 16: 110–144. doi:10.1006/jagm.1994.1006.
Weber K (1995). „The accelerated GCD algorithm”. ACM Trans. Math. Soft. 21: 111–122. doi:10.1145/200979.201042.
Schönhage A (1971). „Schnelle Berechnung von Kettenbruchentwicklungen”. Acta Informatica. 1: 139–144. doi:10.1007/BF00289520.
Möller N (2008). „On Schönhage's algorithm and subquadratic integer gcd computation”. Mathematics of Computation. 77: 589–607. doi:10.1090/S0025-5718-07-02017-0. Legătură externa în |title= (ajutor)
Clark DA (1994). „A quadratic field which is Euclidean but not norm-Euclidean”. Manuscripta mathematica. 83: 327–330. doi:10.1007/BF02567617. Legătură externa în |title= (ajutor)
Jategaonkar AV (1969). „Rings with transfinite left division algorithm”. Bull. Amer. Math. Soc. 75: 559–561. doi:10.1090/S0002-9904-1969-12242-1. Legătură externa în |title= (ajutor)

liu.se

lysator.liu.se

Möller N (2008). „On Schönhage's algorithm and subquadratic integer gcd computation”. Mathematics of Computation. 77: 589–607. doi:10.1090/S0025-5718-07-02017-0. Legătură externa în |title= (ajutor)

loc.gov

lccn.loc.gov

Ogilvy CS, Anderson JT (1966). Excursions in number theory. New York: Oxford University Press. pp. 27–29. LCCN 66-14484.
Stewart BM (1964). Theory of Numbers (ed. 2nd). New York: Macmillan. pp. 43–44. LCCN 64-10964.
Heilbronn HA (1969). „On the Average Length of a Class of Finite Continued Fractions”. În Paul Turán. Number Theory and Analysis. New York: Plenum. pp. 87–96. LCCN 68-8991.

projecteuclid.org

Jategaonkar AV (1969). „Rings with transfinite left division algorithm”. Bull. Amer. Math. Soc. 75: 559–561. doi:10.1090/S0002-9904-1969-12242-1. Legătură externa în |title= (ajutor)

queensu.ca

mast.queensu.ca

Harper M, Murty, MR (2004). „Euclidean Rings of Algebraic Integers”. Canadian Journal of Mathematics. 56: 71–76. Legătură externa în |title= (ajutor)

sciencenews.org

Peterson I (12 august 2002). „Jazzing Up Euclid's Algorithm”. ScienceNews. Legătură externa în |title= (ajutor)

springerlink.com

Clark DA (1994). „A quadratic field which is Euclidean but not norm-Euclidean”. Manuscripta mathematica. 83: 327–330. doi:10.1007/BF02567617. Legătură externa în |title= (ajutor)

wolfram.com

mathworld.wolfram.com

Eric W. Weisstein, Integer Relation la MathWorld.