Euclidean Algorithm
The Euclidean Algorithm is a systematic method in number theory for determining the greatest common divisor of two integers by iteratively applying the division algorithm until the remainder is zero.
213
Publications
9.7K
Citations
349
Authors
220
Institutions
Publications per year
2017–2026
17
213
NP-hardness of Euclidean sum-of-squares clustering
Daniel Aloise, Amit Deshpande, Pierre Hansen et al. · Machine Learning · 2009 · 863 citations · Full text
On Euclid's Algorithm and the Theory of Subresultants
Warren S. Brown, J. F. Traub · Journal of the ACM · 1971 · 258 citations · Full text
1–5 of 213
349
7
h-index
5
h-index
3
h-index
3
h-index
3
h-index
1–5 of 349
220

University of Waterloo
Waterloo, Canada
8 h-index
9 publications
221 citations

Lehigh University
Bethlehem, United States
5 h-index
8 publications
463 citations

McGill University
Montreal, Canada
4 h-index
6 publications
125 citations
Russian Academy of Sciences
Moscow, Russia
3 h-index
3 publications
47 citations
Institute of Applied Mathematics
Vladivostok, Russia
3 h-index
3 publications
47 citations

University of Colorado Denver
Denver, United States
3 h-index
6 publications
128 citations

DEVCOM Army Research Laboratory
Adelphi, United States
3 h-index
3 publications
74 citations

Centre National de la Recherche Scientifique
Paris, France
3 h-index
5 publications
250 citations
1–8 of 220
9 publications · 378 citations
9
h-index
8 publications · 417 citations
8
h-index
6 publications · 236 citations
6
h-index
6 publications · 298 citations
6
h-index
MCOM · 6 publications · 975 citations
6
h-index
1–5