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

Authors

349

  1. BV
    Brigitte Vallée

    GREYC, France

    7 publications · 250 citations

    7

    h-index

  2. TB
    Tamal Bose

    Virginia Tech, United States

    5 publications · 98 citations

    5

    h-index

  3. HL
    Hanho Lee

    Inha University, South Korea

    3 publications · 83 citations

    3

    h-index

  4. SD
    Stephen D. Casey

    American University, United States

    3 publications · 74 citations

    3

    h-index

  5. AV
    Alexey V. Ustinov

    Institute of Bioorganic Chemistry, Russia

    3 publications · 35 citations

    3

    h-index

1–5 of 349

Venues

  1. American Mathematical Monthly

    9 publications · 378 citations

    9

    h-index

  2. SIAM Journal on Computing

    8 publications · 417 citations

    8

    h-index

  3. IEEE Transactions on Information Theory

    6 publications · 236 citations

    6

    h-index

  4. Journal of Symbolic Computation

    6 publications · 298 citations

    6

    h-index

  5. Mathematics of Computation

    MCOM · 6 publications · 975 citations

    6

    h-index

1–5