Analysis of the binary Euclidean algorithm (1976)
by
Richard P. Brent
| Venue: | Directions and Recent Results in Algorithms and Complexity |
| Citations: | 27 - 2 self |
BibTeX
@INPROCEEDINGS{Brent76analysisof,
author = {Richard P. Brent},
title = {Analysis of the binary Euclidean algorithm},
booktitle = {Directions and Recent Results in Algorithms and Complexity},
year = {1976},
pages = {321--355},
publisher = {Academic Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The binary Euclidean algorithm is a variant of the classical Euclidean algorithm. It avoids multiplications and divisions, except by powers of two, so is potentially faster than the classical algorithm on a binary machine. We describe the binary algorithm and consider its average case behaviour. In particular, we correct some errors in the literature, discuss some recent results of Vallée, and describe a numerical computation which supports a conjecture of Vallée. 1
