BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-73-331
       ENTRY:: September 25, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: The computing time of the Euclidean algorithm.
        TYPE:: Technical Report
      AUTHOR:: Collins, George E.
        DATE:: January 1973
       PAGES:: 19
    ABSTRACT:: The maximum, minimum and average computing times of the
               classical Euclidean algorithm for the greatest common divisor
               of two integers are derived, to within codominance, as
               functions of the lengths of the two inputs and the output.
       NOTES:: [Adminitrivia V1/Prg/19950925]
         END:: STAN//CS-TR-73-331