A generalization of the binary GCD algorithm
ISSAC '93 Proceedings of the 1993 international symposium on Symbolic and algebraic computation
Journal of Algorithms
An analysis of Lehmer's Euclidean GCD algorithm
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Parallel implementation of the accelerated integer GCD algorithm
Journal of Symbolic Computation - Special issue on parallel symbolic computation
Modern computer algebra
The Art of Computer Programming Volumes 1-3 Boxed Set
The Art of Computer Programming Volumes 1-3 Boxed Set
Handbook of Applied Cryptography
Handbook of Applied Cryptography
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Half-GCD and fast rational recovery
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
ACM Communications in Computer Algebra
| Hi-index | 0.89 |
Tudor Jebelean and Ken Weber introduced an algorithm for finding (a,b)-pairs satisfying au+bv=0 (mod k), with 0