A redundant binary Euclidean GCD algorithm

Shrikant N. Parikh, David W. Matula. A redundant binary Euclidean GCD algorithm. In 10th IEEE Symposium on Computer Arithmetic, ARITH 1991, Grenoble, France, June 26-28, 1991. pages 220-225, IEEE, 1991. [doi]

@inproceedings{ParikhM91,
  title = {A redundant binary Euclidean GCD algorithm},
  author = {Shrikant N. Parikh and David W. Matula},
  year = {1991},
  doi = {10.1109/ARITH.1991.145563},
  url = {http://dx.doi.org/10.1109/ARITH.1991.145563},
  researchr = {https://researchr.org/publication/ParikhM91},
  cites = {0},
  citedby = {0},
  pages = {220-225},
  booktitle = {10th IEEE Symposium on Computer Arithmetic, ARITH 1991, Grenoble, France, June 26-28, 1991},
  publisher = {IEEE},
  isbn = {0-8186-9151-4},
}