Sieve Methods

Sieve Methods is a collection of combinatorial and analytic techniques in number theory that estimates the size of sifted sets of integers by systematically excluding elements with specified prime divisors or other arithmetic properties, typically through refined forms of the inclusion–exclusion principle and weighted counting.

403

Publications

19.3K

Citations

731

Authors

329

Institutions

Publications per year

2017–2026

28

Authors

731

  1. HI
    Henryk Iwaniec

    Rutgers, The State University of New Jersey, United States

    11 publications · 521 citations

    11

    h-index

  2. RF
    Ray F. Evert

    University of Wisconsin–Madison, United States

    6 publications · 205 citations

    6

    h-index

  3. AK
    Arjen K. Lenstra

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

    5 publications · 217 citations

    5

    h-index

  4. JF
    John Friedlander

    University of Toronto, Canada

    5 publications · 153 citations

    5

    h-index

  5. OS
    Oliver Schirokauer

    Oberlin College, United States

    4 publications · 231 citations

    4

    h-index

1–5 of 731

Venues

  1. Mathematics of Computation

    MCOM · 30 publications · 1.1K citations

    19

    h-index

  2. Acta Arithmetica

    18 publications · 805 citations

    14

    h-index

  3. Powder Technology

    9 publications · 198 citations

    9

    h-index

  4. Mathematika

    8 publications · 475 citations

    8

    h-index

  5. Journal of Number Theory

    8 publications · 234 citations

    8

    h-index

1–5