Sieve Algorithms

Sieve Algorithms is a class of systematic methods in number-theoretic algorithms that identify prime numbers or filter integer sequences by iteratively eliminating composite numbers based on modular arithmetic properties, distinguished from other factorization or primality testing techniques by their use of incremental sieving processes over structured number sets.

167

Publications

7.5K

Citations

239

Authors

130

Institutions

Publications per year

2017–2026

9

Authors

239

  1. AK
    Arjen K. Lenstra

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

    6 publications · 499 citations

    6

    h-index

  2. HI
    Henryk Iwaniec

    Rutgers, The State University of New Jersey, United States

    6 publications · 322 citations

    6

    h-index

  3. JS
    Jonathan Sorenson

    Butler University, United States

    4 publications · 69 citations

    4

    h-index

  4. MS
    Mark S. Manasse

    Microsoft (United States), United States

    4 publications · 433 citations

    4

    h-index

  5. HW
    H. W. Lenstra

    University of California, Berkeley, United States

    3 publications · 398 citations

    3

    h-index

1–5 of 239

Venues

  1. Mathematics of Computation

    MCOM · 18 publications · 795 citations

    14

    h-index

  2. Acta Arithmetica

    13 publications · 479 citations

    12

    h-index

  3. Journal of Number Theory

    6 publications · 145 citations

    6

    h-index

  4. Communications of the ACM

    4 publications · 133 citations

    4

    h-index

  5. The Annals of Statistics

    4 publications · 449 citations

    4

    h-index

1–5