Algorithmic Number Theory

Algorithmic Number Theory is a branch of computational mathematics that systematically studies algorithms for solving problems in number theory, distinguished by its focus on the design, analysis, and implementation of effective procedures for number-theoretic computations.

68

Publications

4.6K

Citations

114

Authors

75

Institutions

Publications per year

2017–2026

7

Authors

114

  1. HW
    H. W. Lenstra

    University of California, Berkeley, United States

    2 publications · 262 citations

    2

    h-index

  2. MF
    Martin Fürer

    Pennsylvania State University, United States

    2 publications · 462 citations

    2

    h-index

  3. GL
    Grégoire Lecerf

    École Polytechnique, France

    2 publications · 94 citations

    2

    h-index

  4. LI
    Laurent Imbert

    Laboratoire d'Informatique, de Robotique et de Microélectronique de Montpellier, France

    2 publications · 47 citations

    2

    h-index

  5. CA
    Chinnaraji Annamalai

    Indian Institute of Technology Kharagpur, India

    2 publications · 25 citations

    2

    h-index

1–5 of 114

Venues

  1. Choice Reviews Online

    CRO · 4 publications · 153 citations

    4

    h-index

  2. Computers & Mathematics with Applications

    3 publications · 49 citations

    3

    h-index

  3. SIAM Journal on Computing

    3 publications · 577 citations

    3

    h-index

  4. American Mathematical Monthly

    3 publications · 1.1K citations

    3

    h-index

  5. Mathematics of Computation

    MCOM · 3 publications · 125 citations

    3

    h-index

1–5