Computational Gcd Algorithms
Computational Gcd Algorithms is a class of algorithmic methods in number theory that systematically determine the greatest common divisor of two integers through iterative applications of the Euclidean division principle.
179
Publications
7.8K
Citations
245
Authors
146
Institutions
Publications per year
2017–2026
12
Parents
179
1–5 of 179
245
Chinese Academy of Agricultural Mechanization Sciences, China
6 publications · 210 citations
6
h-index
5
h-index
5
h-index
National and Kapodistrian University of Athens, Greece
5 publications · 139 citations
5
h-index
4
h-index
1–5 of 245
146

University of Waterloo
Waterloo, Canada
6 h-index
15 publications
984 citations

City, University of London
London, United Kingdom
5 h-index
8 publications
261 citations
Simon Fraser University
Burnaby, Canada
5 h-index
7 publications
123 citations
Northampton Community College
Bethlehem, United States
4 h-index
7 publications
193 citations

Western University
London, Canada
4 h-index
10 publications
449 citations
Massachusetts Institute of Technology
Cambridge, United States
4 h-index
5 publications
209 citations

Tampere University
Tampere, Finland
4 h-index
7 publications
166 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
4 h-index
8 publications
513 citations
1–8 of 146
12 publications · 429 citations
12
h-index
8 publications · 272 citations
8
h-index
7 publications · 206 citations
7
h-index
MCOM · 6 publications · 1.5K citations
6
h-index
4 publications · 65 citations
4
h-index
1–5