Concrete mathematics: a foundation for computer science
Concrete mathematics: a foundation for computer science
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Algorithm and bound for the greatest common divisor of n integers
Communications of the ACM
The complexity of greatest common divisor computations
ANTS-I Proceedings of the First International Symposium on Algorithmic Number Theory
On the worst-case complexity of integer Gaussian elimination
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
A solution to the extended GCD problem with applications
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Efficient parallel solution of sparse systems of linear diophantine equations
PASCO '97 Proceedings of the second international symposium on Parallel symbolic computation
NC2 computation of gcd-free basis and application to parallel algebraic numbers computation
PASCO '97 Proceedings of the second international symposium on Parallel symbolic computation
GCD of many integers (extended abstract)
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
| Hi-index | 0.00 |