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

Authors

245

  1. LZ
    Lihong Zhi

    Chinese Academy of Agricultural Mechanization Sciences, China

    6 publications · 210 citations

    6

    h-index

  2. MM
    Michael Monagan

    Simon Fraser University, Canada

    5 publications · 90 citations

    5

    h-index

  3. TS
    Tateaki Sasaki

    University of Tsukuba, Japan

    5 publications · 153 citations

    5

    h-index

  4. MM
    Marilena Mitrouli

    National and Kapodistrian University of Athens, Greece

    5 publications · 139 citations

    5

    h-index

  5. NK
    N. Karcanias

    City, University of London, United Kingdom

    4 publications · 91 citations

    4

    h-index

1–5 of 245

Venues

  1. Journal of Symbolic Computation

    12 publications · 429 citations

    12

    h-index

  2. Linear Algebra and its Applications

    8 publications · 272 citations

    8

    h-index

  3. Acta Arithmetica

    7 publications · 206 citations

    7

    h-index

  4. Mathematics of Computation

    MCOM · 6 publications · 1.5K citations

    6

    h-index

  5. Theoretical Computer Science

    4 publications · 65 citations

    4

    h-index

1–5