Linked Data Explorerhttp://worldcat.org/entity/work/id/20438278
Analysis of the binary Euclidean algorithm
In this paper the author analyzes a continuous model of the binary algorithm and finds the expected number of iterations. The results agree with the observed behavior of the algorithm much better than those predicted by Knuth's 'lattice-point' model.
Open All Close All
http://schema.org/about
- http://id.worldcat.org/fast/805020
- http://experiment.worldcat.org/entity/work/data/20438278#Topic/algorithms
- http://experiment.worldcat.org/entity/work/data/20438278#Topic/binary_arithmetic
- http://id.loc.gov/authorities/subjects/sh85003487
- http://experiment.worldcat.org/entity/work/data/20438278#Topic/iterations
- http://experiment.worldcat.org/entity/work/data/20438278#Topic/theorems
- http://experiment.worldcat.org/entity/work/data/20438278#Topic/statistics_and_probability
- http://experiment.worldcat.org/entity/work/data/20438278#Topic/distribution_functions
http://schema.org/description
- "In this paper the author analyzes a continuous model of the binary algorithm and finds the expected number of iterations. The results agree with the observed behavior of the algorithm much better than those predicted by Knuth's 'lattice-point' model."@en