хранилище/kolxo3/issue5─6/DVD12/_Papers/Numerical_methods/GCD/
01 011164 Bernstein_fast_gcd_notes.txt [request] 02-09-2013:02-50

02 011165 Bradley. Algorithm 386. GCD of n integers and multipliers (CACM1970)(T)(4s).djvu [request] 02-09-2013:02-50

03 011166 Bradley. New Euclidean algorithm for GCD (CACM 1970)(T)(4s).djvu [request] 02-09-2013:02-50

04 011167 Brown. Euclid algorithm and polynomial GCD analysis (SIGSAM1971)(T)(17s).djvu [request] 02-09-2013:02-50

05 011168 Jebelean. Generalization of Euclidean GCD(8s).ps.gz [request] 02-09-2013:02-50

06 011169 Jebelean. Lehmer-Euclid GCD algorithm(15s).ps.gz [request] 02-09-2013:02-50

07 011170 Moenck. Fast computation of GCDs using Schoenhage (ACM1973)(T)(10s).djvu [request] 02-09-2013:02-50

08 011171 Pottier. Euclidean algorithm in dimension n (ISSAC96)(T)(3s).djvu [request] 02-09-2013:02-50

09 011172 Sorenson. Analysis of Lehmer#s GCD algorithm. ISSAC95(T)(5s).djvu [request] 02-09-2013:02-50

10 011173 Weber. Accelerated integer GCD. TOMS 1995(T)(12s).djvu [request] 02-09-2013:02-50

11 011174 Yap. integer and polynomial HGCD algorithms(23s).ps.gz [request] 02-09-2013:02-50