The Complexity of Approximate Optima for Greatest Common Divisor Computations

On the worst-case complexity of integer Gaussian elimination

ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation

The Complexity of the Extended GCD Problem

MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science

An improved lower bound for approximating minimum GCD multiplier in l∞ norm (GCDM∞)

Theoretical Computer Science

Approximate polynomial GCD over integers

Journal of Symbolic Computation