Euklideszi algoritmus (Hungarian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Euklideszi algoritmus" in Hungarian language version.

refsWebsite

Global rank Hungarian rank

25archive.org

6^th place

14^th place

19doi.org

2^nd place

8^th place

14books.google.com

3^rd place

28^th place

2wolfram.com

513^th place

378^th place

2web.archive.org

1^st place

1liu.se

9,195^th place

low place

1springerlink.com

2,569^th place

791^st place

1sciencenews.org

3,410^th place

3,321^st place

1siam.org

low place

archive.org

Grossman, J. W.. Discrete Mathematics. New York: Macmillan, 213. o. (1990). ISBN 0-02-348331-8
Excursions in number theory. New York: Oxford University Press, 27–29. o. (1966)
Kimberling, C. (1983). „A Visual Euclidean Algorithm”. Mathematics Teacher 76, 108–109. o.
Stewart, B. M.. Theory of Numbers, 2nd, New York: Macmillan, 43–44. o. (1964)
Grossman, H. (1924). „On the Number of Divisions in Finding a G.C.D”. The American Mathematical Monthly 31 (9), 443. o. DOI:10.2307/2298146.
Knuth, D. E. (1976). „Evaluation of Porter's Constant”. Computers and Mathematics with Applications 2 (2), 137–139. o. DOI:10.1016/0898-1221(76)90025-0.
Wagon, S.. Mathematica in Action. New York: Springer-Verlag, 335–336. o. (1999). ISBN 0-387-98252-3
The Design and Analysis of Computer Algorithms. New York: Addison–Wesley, 300–310. o. (1974). ISBN 0-201-00029-6
Bezout's Identity, Elementary Number Theory. New York: Springer-Verlag, 7–11. o. (1998)
Algorithmic number theory. Cambridge, MA: MIT Press, 70–73. o. (1996). ISBN 0-262-02405-5
Vinogradov, I. M.. Elements of Number Theory. New York: Dover, 3–13. o. (1954)
Dixon, J. D. (1981). „Asymptotically fast factorization of integers”. Math. Comput. 36 (153), 255–260. o. DOI:10.2307/2007743.
Lenstra, H. W., Jr. (1987). „Factoring integers with elliptic curves”. Annals of Mathematics 126 (3), 649–673. o. DOI:10.2307/1971363.
Lang, S.. Algebra, 2nd, Menlo Park, CA: Addison–Wesley, 190–194. o. (1984). ISBN 0-201-05487-6
A History of Mathematics, 2nd, New York: Wiley, 116–117. o. (1991). ISBN 0-471-54397-7
Cajori, F,. A History of Mathematics. New York: Macmillan, 70. o. (1894). ISBN 0-486-43874-0
Introduction to Number Theory. Prentice-Hall (1976). ISBN 9780134912820 „State and prove an analogue of the Chinese remainder theorem for the Gaussian integers.”
Edwards, H.. Fermat's last theorem: a genetic introduction to algebraic number theory. Springer, 76. o. (2000)
LeVeque, W. J.. Topics in Number Theory, Volumes I and II. New York: Dover Publications, II:57,81. o. [1956] (2002). ISBN 978-0-486-42539-9
van der Waerden, B. L.. Science Awakening, translated by Arnold Dresden. Groningen: P. Noordhoff Ltd, 114–115. o. (1954)
von Fritz, K. (1945). „The Discovery of Incommensurability by Hippasus of Metapontum”. Annals of Mathematics 46 (2), 242–264. o. DOI:10.2307/1969021.
Heath, T. L.. Mathematics in Aristotle. Oxford Press, 80–83. o. (1949)
Fowler, D. H.. The Mathematics of Plato's Academy: A New Reconstruction. Oxford: Oxford University Press, 31–66. o. (1987). ISBN 0-19-853912-6
(1969) „A game based on the Euclidean algorithm and a winning strategy for it”. Math. Gaz. 53 (386), 354–357. o. DOI:10.2307/3612461.
Roberts, J.. Elementary Number Theory: A Problem Oriented Approach. Cambridge, MA: MIT Press, 1–8. o. (1977). ISBN 0-262-68028-9

books.google.com

Sorenson, Jonathan P.. High primes and misdemeanours: lectures in honour of the 60th birthday of Hugh Cowie Williams, Fields Institute Communications. Providence, RI: American Mathematical Society, 327–340. o. (2004) „The algorithms that are used the most in practice today [for computing greatest common divisors] are probably the binary algorithm and Euclid's algorithm for smaller numbers, and either Lehmer's algorithm or Lebealean's version of the k-ary GCD algorithm for larger numbers.”
Joux, Antoine. Algorithmic Cryptanalysis. CRC Press, 33. o. (2009). ISBN 9781420070033
Mathematical Omnibus: Thirty Lectures on Classic Mathematics. American Mathematical Society, 13. o. (2007). ISBN 9780821843161
Darling, David. The Universal Book of Mathematics: From Abracadabra to Zeno's Paradoxes. John Wiley & Sons, 175. o. (2004). ISBN 9780471667001
Williams, Colin P.. Explorations in Quantum Computing. Springer, 277–278. o. (2010). ISBN 9781846288876
Grattan-Guinness, Ivor. Convolutions in French Mathematics, 1800-1840: From the Calculus and Mechanics to Mathematical Analysis and Mathematical Physics. Volume II: The Turns, Science Networks: Historical Studies. Basel, Boston, Berlin: Birkhäuser, 1148. o. (1990). ISBN 9783764322380 „Our subject here is the 'Sturm sequence' of functions defined from a function and its derivative by means of Euclid's algorithm, in order to calculate the number of real roots of a polynomial within a given interval”
Solving Ordinary Differential Equations I: Nonstiff Problems, 2nd, Springer Series in Computational Mathematics, Springer, 81ff. o. (1993). ISBN 9783540566700
Hensley, Doug. Continued Fractions. World Scientific, 26. o. (2006). ISBN 9789812564771
Dedekind, Richard. Theory of Algebraic Integers, Cambridge Mathematical Library. Cambridge University Press, 22–24. o. (1996). ISBN 9780521565189
Numbers and Symmetry: An Introduction to Algebra. CRC Press, 44. o. (1997). ISBN 9780849303012
Lauritzen, Niels. Concrete Abstract Algebra: From Numbers to Gröbner Bases. Cambridge University Press, 130. o. (2003). ISBN 9780521534109
Sharpe, David. Rings and Factorization. Cambridge University Press, 55. o. (1987). ISBN 9780521337182
Elementary Number Theory, Group Theory and Ramanujan Graphs, London Mathematical Society Student Texts. Cambridge University Press, 59–70. o. (2003). ISBN 9780521531436
Ribenboim, Paulo. Classical Theory of Algebraic Numbers, Universitext. Springer-Verlag, 104. o. (2001). ISBN 9780387950709

doi.org

dx.doi.org

Shallit, J. (1994). „Origins of the analysis of the Euclidean algorithm”. Historia Math. 21, 401–419. o. DOI:10.1006/hmat.1994.1031.
Grossman, H. (1924). „On the Number of Divisions in Finding a G.C.D”. The American Mathematical Monthly 31 (9), 443. o. DOI:10.2307/2298146.
Möller, N. (2008). „On Schönhage's algorithm and subquadratic integer gcd computation”. Mathematics of Computation 77 (261), 589–607. o. DOI:10.1090/S0025-5718-07-02017-0.
Porter, J. W. (1975). „On a Theorem of Heilbronn”. Mathematika 22, 20–28. o. DOI:10.1112/S0025579300004459.
Knuth, D. E. (1976). „Evaluation of Porter's Constant”. Computers and Mathematics with Applications 2 (2), 137–139. o. DOI:10.1016/0898-1221(76)90025-0.
Dixon, J. D. (1970). „The Number of Steps in the Euclidean Algorithm”. J. Number Theory 2 (4), 414–422. o. DOI:10.1016/0022-314X(70)90044-2.
Norton, G. H. (1990). „On the Asymptotic Analysis of the Euclidean Algorithm”. Journal of Symbolic Computation 10, 53–58. o. DOI:10.1016/S0747-7171(08)80036-3.
Stein, J. (1967). „Computational problems associated with Racah algebra”. Journal of Computational Physics 1 (3), 397–405. o. DOI:10.1016/0021-9991(67)90047-2.
Lehmer, D. H. (1938). „Euclid's Algorithm for Large Numbers”. The American Mathematical Monthly 45 (4), 227–233. o. DOI:10.2307/2302607.
Sorenson, J. (1994). „Two fast GCD algorithms”. J. Algorithms 16, 110–144. o. DOI:10.1006/jagm.1994.1006.
Schönhage, A. (1971). „Schnelle Berechnung von Kettenbruchentwicklungen”. Acta Informatica 1 (2), 139–144. o. DOI:10.1007/BF00289520.
Shor, P. W. (1997). „Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer”. SIAM Journal on Scientific and Statistical Computing 26, 1484. o. DOI:10.1137/s0097539795293172.
Dixon, J. D. (1981). „Asymptotically fast factorization of integers”. Math. Comput. 36 (153), 255–260. o. DOI:10.2307/2007743.
Lenstra, H. W., Jr. (1987). „Factoring integers with elliptic curves”. Annals of Mathematics 126 (3), 649–673. o. DOI:10.2307/1971363.
Gauss, C. F. (1832). „Theoria residuorum biquadraticorum”. Comm. Soc. Reg. Sci. Gött. Rec. 4. Reprinted in Gauss, C. F.. Werke. Cambridge Univ. Press, 65–92. o.. doi:10.1017/CBO9781139058230.004 and doi:10.1017/CBO9781139058230.005 (2011)
Clark, D. A. (1994). „A quadratic field which is Euclidean but not norm-Euclidean”. Manuscripta Mathematica 83, 327–330. o. DOI:10.1007/BF02567617. ^{[halott link]}
von Fritz, K. (1945). „The Discovery of Incommensurability by Hippasus of Metapontum”. Annals of Mathematics 46 (2), 242–264. o. DOI:10.2307/1969021.
(1969) „A game based on the Euclidean algorithm and a winning strategy for it”. Math. Gaz. 53 (386), 354–357. o. DOI:10.2307/3612461.
Spitznagel, E. L. (1973). „Properties of a game based on Euclid's algorithm”. Math. Mag. 46 (2), 87–92. o. DOI:10.2307/2689037.

liu.se

lysator.liu.se

Möller, N. (2008). „On Schönhage's algorithm and subquadratic integer gcd computation”. Mathematics of Computation 77 (261), 589–607. o. DOI:10.1090/S0025-5718-07-02017-0.

sciencenews.org

Peterson, I. (2002. augusztus 12.). „Jazzing Up Euclid's Algorithm”. ScienceNews.

siam.org

Cipra, B. A. (2000. május 16.). „The Best of the 20th Century: Editors Name Top 10 Algorithms”. SIAM News 33 (4), Kiadó: Society for Industrial and Applied Mathematics. [2016. szeptember 22-i dátummal az eredetiből archiválva]. (Hozzáférés: 2016. augusztus 13.)

springerlink.com

Clark, D. A. (1994). „A quadratic field which is Euclidean but not norm-Euclidean”. Manuscripta Mathematica 83, 327–330. o. DOI:10.1007/BF02567617. ^{[halott link]}

web.archive.org

Clark, D. A. (1994). „A quadratic field which is Euclidean but not norm-Euclidean”. Manuscripta Mathematica 83, 327–330. o. DOI:10.1007/BF02567617. ^{[halott link]}
Cipra, B. A. (2000. május 16.). „The Best of the 20th Century: Editors Name Top 10 Algorithms”. SIAM News 33 (4), Kiadó: Society for Industrial and Applied Mathematics. [2016. szeptember 22-i dátummal az eredetiből archiválva]. (Hozzáférés: 2016. augusztus 13.)

wolfram.com

mathworld.wolfram.com

Weisstein, Eric W.: Porter's Constant (angol nyelven). Wolfram MathWorld
Weisstein, Eric W.: Integer Relation (angol nyelven). Wolfram MathWorld