Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
Euclidean algorithm
Description:
The Euclidean algorithm is a number-theoretic procedure for finding the greatest common divisor of two integers through repeated division.
Related topics:
Analytic Number Theory Research (12%),
Cryptography and Residue Arithmetic (11%),
Polynomial and algebraic computation (8%),
History and Theory of Mathematics (8%),
Algebraic Geometry and Number Theory (7%)
Wikidata ID:
wiki/Q230848
OpenAlex ID:
keywords/euclidean-algorithm
Factoring wavelet transforms into lifting steps
1998
·
Ingrid Daubechies
, Wim Sweldens
·
Journal of Fourier Analysis and Applications
·
1,872
Modern computer algebra
2000
·
Choice Reviews Online
·
1,616
Elementary Number Theory and Its Applications.
1987
·
S. S. Wagstaff
, Kenneth H. Rosen
·
Mathematics of Computation
·
836
Über einige Anwendungen diophantischer Approximationen: Abhandlungen der Preußischen Akademie der Wissenschaften. Physikalisch-mathematische Klasse 1929, Nr. 1
2014
·
Carl L. Siegel
·
Scuola Normale Superiore eBooks
·
466
Theory Of Difference Equations Numerical Methods And Applications
2002
·
V. Lakshmikantham
, V. Trigiante
·
CRC Press eBooks
·
439
Shor's discrete logarithm quantum algorithm for elliptic curves
2003
·
J. Proos
, Ch. Zalka
·
Quantum Information and Computation
·
424
PDF
A method for solving key equation for decoding goppa codes
1975
·
Yasuo Sugiyama
, Masao Kasahara
, et al.
·
Information and Control
·
406
The Fundamental Properties of Natural Numbers
1990
·
Grzegorz Bancerek
·
385
Subresultants and Reduced Polynomial Remainder Sequences
1967
·
George E. Collins
·
Journal of the ACM
·
319
On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
1971
·
W. S. Brown
·
Journal of the ACM
·
295
PDF
On the partial realization problem
1983
·
William B. Gragg
, Anders Lindquist
·
Linear Algebra and its Applications
·
270
On Euclid's Algorithm and the Theory of Subresultants
1971
·
W. S. Brown
, J. F. Traub
·
Journal of the ACM
·
256
PDF
Free Ideal Rings and Localization in General Rings
2006
·
P. M. Cohn
·
Cambridge University Press eBooks
·
230
Data transformations for eliminating conflict misses
1998
·
Gabriel Rivera
, Chau-Wen Tseng
·
ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)
·
224
PDF
History of Continued Fractions and Padé Approximants
1991
·
Claude Brezinski
·
Springer series in computational mathematics
·
204
Schnelle Berechnung von Kettenbruchentwicklungen
1971
·
A. Sch�nhage
·
Acta Informatica
·
199
Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
1991
·
Karla L. Hoffman
, Manfred Padberg
·
INFORMS journal on computing
·
154
On computing multiplicative inverses in GF(2/sup m/)
1993
·
H. Brunner
, A. Curiger
, et al.
·
IEEE Transactions on Computers
·
139
On the Infinitude of Primes
1955
·
Harry Furstenberg
·
American Mathematical Monthly
·
129
Euclid's Algorithm for Large Numbers
1938
·
D. H. Lehmer
·
American Mathematical Monthly
·
128
Foundations of Algorithms
1996
·
Richard E. Neapolitan
, Kumarss Naimipour
·
118
On Artin's conjecture and Euclid's algorithm in global fields
1977
·
H. W. Lenstra
·
Inventiones mathematicae
·
118
On the equivalence between Berlekamp's and Euclid's algorithms (Corresp.)
1987
·
J. Dornstetter
·
IEEE Transactions on Information Theory
·
113
Fast constant-time gcd computation and modular inversion
2019
·
Daniel J. Bernstein
, Bo-Yin Yang
·
IACR Transactions on Cryptographic Hardware and Embedded Systems
·
107
On recursiveness and related topics in linear systems
1986
·
A. Antoulas
·
IEEE Transactions on Automatic Control
·
104
Show more works
View as search
Works count:
2,439
Citation count:
18,730
Year
Topic
Type