Remainder Sequences
Remainder Sequences is a mathematical construct defined as the ordered sequence of non-negative integers generated iteratively by applying the division algorithm in the Euclidean Algorithm, where each term is the remainder resulting from the division of the preceding two terms, terminating upon reaching zero.
42
Publications
3.5K
Citations
69
Authors
38
Institutions
Publications per year
2017–2026
1
Variants
Euclidean Remainder Sequences
Parents
42
Homogenization and Two-Scale Convergence
Grégoire Allaire · SIAM Journal on Mathematical Analysis · 1992 · 2.3K citations · Full text
Subresultants and Reduced Polynomial Remainder Sequences
George E. Collins · Journal of the ACM · 1967 · 330 citations
1–5 of 42
69
2
h-index
2
h-index
2
h-index
1
h-index
1 publications · 25 citations
1
h-index
1–5 of 69
38
IBM (United States)
Armonk, United States
2 h-index
3 publications
80 citations

University of Alberta
Edmonton, Canada
2 h-index
2 publications
34 citations
University of Washington
Seattle, United States
2 h-index
2 publications
33 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
2 h-index
2 publications
370 citations
University of Wuppertal
Wuppertal, Germany
1 h-index
1 publications
15 citations

University of Cologne
Cologne, Germany
1 h-index
2 publications
40 citations

University of Waterloo
Waterloo, Canada
1 h-index
1 publications
21 citations

University of Aberdeen
Aberdeen, United Kingdom
1 h-index
1 publications
12 citations
1–8 of 38
5 publications · 110 citations
5
h-index
2 publications · 52 citations
2
h-index
2 publications · 48 citations
2
h-index
2 publications · 33 citations
2
h-index
Repository · 1 publications · 17 citations
1
h-index
1–5