Hierarchical approaches for multicast based on Euclid’s algorithm

2013 ◽  
Vol 65 (3) ◽  
pp. 1164-1178
Author(s):  
J. A. Álvarez-Bermejo ◽  
N. Antequera ◽  
J. A. López-Ramos
Keyword(s):  
Euclid’S Algorithm ◽  
Euclid's Algorithm

Euclid's algorithm

2011 ◽  
pp. 808-811
Author(s):  
P. P. Vaidyanathan ◽  
See-May Phoong ◽  
Yuan-Pei Lin
Keyword(s):  
Euclid’S Algorithm ◽  
Euclid's Algorithm

On the Moebius Knot Tree and Euclid’s Algorithm

1991 ◽  
pp. 257-270
Author(s):  
A. G. Schaake ◽  
J. C. Turner
Keyword(s):  
Euclid’S Algorithm ◽  
Euclid's Algorithm

New Cost-Effective Simplified Euclid’s Algorithm for Reed-Solomon Decoders

2012 ◽  
Vol 71 (2) ◽  
pp. 159-168 ◽  
Author(s):  
Jaehyun Baek ◽  
◽  
Myung Hoon Sunwoo
Keyword(s):  
Cost Effective ◽  
Euclid’S Algorithm ◽  
Euclid's Algorithm

Euclid's Algorithm Revisited

1967 ◽  
Vol 60 (4) ◽  
pp. 358
Author(s):  
B. L. Foster
Keyword(s):  
Automatic Machine ◽  
Greatest Common Divisor ◽  
Machine Computation ◽  
Euclid’S Algorithm ◽  
Integer Division ◽  
Euclid's Algorithm

Since integer division reduces to repeated subtraction, Euclid's algorithm for finding the greatest common divisor may be recast in terms of subtraction. This is done, for example, in Trakhtenbrot,1 for automatic machine computation.

An Alternative to Euclid’s Algorithm

1979 ◽  
Vol 101 (4) ◽  
pp. 582-585
Author(s):  
G. K. Matthew
Keyword(s):  
Euclid’S Algorithm ◽  
Computational Procedures ◽  
Euclid's Algorithm ◽  
General Method

A general method for finding factors common to two polynomials is developed. The process is shown to have immediate application to the removal of multiplicities when attempting to root polynomials. Computational procedures and likely difficulties are discussed.

On Euclid's Algorithm in cubic self-conjugate fields

1950 ◽  
Vol 46 (3) ◽  
pp. 377-382 ◽  
Author(s):  
H. Heilbronn
Keyword(s):  
Finite Number ◽  
Quadratic Fields ◽  
Euclid’S Algorithm ◽  
Euclid's Algorithm

In a paper published in these Proceedings I proved that there are only a finite number of quadratic fields in which Euclid's Algorithm (E.A.) holds. Recently Davenport has found a new proof of this theorem based on the theory of the minima of the product of linear inhomogeneous forms.

Sign in / Sign up

Export Citation Format

Share Document