Continued Fraction Algorithms

Continued Fraction Algorithms is a computational method in number theory that systematically generates and manipulates continued fraction representations of real numbers to solve problems such as Diophantine approximations, integer factorization, and quadratic irrationals characterization.

393

Publications

15.8K

Citations

527

Authors

331

Institutions

Publications per year

2017–2026

21

Variants

Continued Fraction Algorithm

Authors

527

  1. WJ
    W. J. Thron

    University of Colorado Boulder, United States

    12 publications · 257 citations

    12

    h-index

  2. PF
    Philippe Flajolet

    Institut national de recherche en sciences et technologies du numérique, France

    8 publications · 742 citations

    8

    h-index

  3. VB
    Valérie Berthé

    Centre National de la Recherche Scientifique, France

    6 publications · 165 citations

    6

    h-index

  4. CK
    Cor Kraaikamp

    Delft University of Technology, Netherlands

    6 publications · 187 citations

    6

    h-index

  5. EB
    Edward B. Van Vleck

    Université Fédérale de Toulouse Midi-Pyrénées, France

    5 publications · 133 citations

    5

    h-index

1–5 of 527

Venues

  1. Mathematics of Computation

    MCOM · 23 publications · 1.1K citations

    16

    h-index

  2. Transactions of the American Mathematical Society

    TRAN · 9 publications · 286 citations

    9

    h-index

  3. IEEE Transactions on Automatic Control

    8 publications · 474 citations

    8

    h-index

  4. Journal of Number Theory

    8 publications · 229 citations

    8

    h-index

  5. International Journal of Control

    8 publications · 281 citations

    8

    h-index

1–5