Sieving Algorithms

Sieving Algorithm is a computational method in number theory that systematically eliminates non-candidate elements from a set of potential solutions to efficiently isolate primes or integer relations through incremental divisibility testing.

102

Publications

4.3K

Citations

139

Authors

81

Institutions

Publications per year

2017–2026

7

Authors

139

  1. AK
    Arjen K. Lenstra

    École Polytechnique Fédérale de Lausanne, Switzerland

    6 publications · 499 citations

    6

    h-index

  2. MS
    Mark S. Manasse

    Microsoft (United States), United States

    4 publications · 433 citations

    4

    h-index

  3. JS
    Jonathan Sorenson

    Butler University, United States

    4 publications · 69 citations

    4

    h-index

  4. OS
    Oliver Schirokauer

    Oberlin College, United States

    3 publications · 172 citations

    3

    h-index

  5. JM
    J. M. Pollard

    University of California, Berkeley, United States

    3 publications · 398 citations

    3

    h-index

1–5 of 139

Venues

  1. Mathematics of Computation

    MCOM · 20 publications · 825 citations

    14

    h-index

  2. Choice Reviews Online

    CRO · 4 publications · 429 citations

    4

    h-index

  3. IACR Cryptology ePrint Archive

    Repository · 4 publications · 79 citations

    4

    h-index

  4. Journal of Number Theory

    4 publications · 94 citations

    4

    h-index

  5. Communications of the ACM

    4 publications · 133 citations

    4

    h-index

1–5