Extended Euclidean Algorithm

The Extended Euclidean Algorithm is an algorithmic method that, given a pair of integers, computes not only their greatest common divisor but also the coefficients of Bézout's identity, thereby expressing the gcd as a linear combination of the inputs.

74

Publications

2.8K

Citations

164

Authors

101

Institutions

Publications per year

2017–2026

8

Authors

164

  1. SD
    Stephen D. Casey

    American University, United States

    3 publications · 65 citations

    3

    h-index

  2. AC
    Alejandro Cabrera Aldaya

    Polytechnic José Antonio Echeverría, Cuba

    3 publications · 78 citations

    3

    h-index

  3. VY
    Victor Y. Pan

    Lehman College, United States

    3 publications · 104 citations

    3

    h-index

  4. BM
    Brian M. Sadler

    DEVCOM Army Research Laboratory, United States

    3 publications · 65 citations

    3

    h-index

  5. XW
    Xinmao Wang

    University of Science and Technology of China, China

    3 publications · 104 citations

    3

    h-index

1–5 of 164

Venues

  1. Journal of Symbolic Computation

    3 publications · 250 citations

    3

    h-index

  2. 2

    h-index

  3. SIAM Journal on Computing

    2 publications · 73 citations

    2

    h-index

  4. 2

    h-index

  5. IEEE Transactions on Communications

    2 publications · 76 citations

    2

    h-index

1–5