CALYPSO

swMATH100MaRDI QIDQ12870FDOQ12870

Author name not available (Why is that?)

Cited In (3)

• Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms
• \((1+i)\)-ary GCD computation in \(\mathbb Z[i]\) as an analogue to the binary GCD algorithm.
• Fault-tolerance mechanisms for a parallel programming system -- a responsiveness perspective

This page was built for software: CALYPSO