Prime Generation Algorithms

Prime Generation Algorithms is a class of deterministic or probabilistic computational methods designed to systematically produce prime numbers within specified bounds, distinguished from other number-theoretic algorithms by their specific objective of generating primes rather than testing primality or factoring composites.

79

Publications

9.6K

Citations

138

Authors

82

Institutions

Publications per year

2017–2026

3

Variants

Prime Generation Algorithm

Authors

138

  1. CP
    Carl Pomerance

    University of Georgia, United States

    4 publications · 163 citations

    4

    h-index

  2. AL
    Andrea Lucchini

    University of Padua, Italy

    2 publications · 27 citations

    2

    h-index

  3. DZ
    Don Zagier

    Max Planck Institute for Mathematics, Germany

    2 publications · 89 citations

    2

    h-index

  4. PB
    Pedro Berrizbeitia

    Simón Bolívar University, Venezuela

    2 publications · 37 citations

    2

    h-index

  5. JB
    Joe Buhler

    Reed College, United States

    2 publications · 78 citations

    2

    h-index

1–5 of 138

Venues

  1. Mathematics of Computation

    MCOM · 14 publications · 321 citations

    13

    h-index

  2. Communications of the ACM

    6 publications · 225 citations

    6

    h-index

  3. IEEE Transactions on Computers

    3 publications · 170 citations

    3

    h-index

  4. Journal of the ACM

    JACM · 3 publications · 267 citations

    3

    h-index

  5. Journal of Algebra

    3 publications · 46 citations

    3

    h-index

1–5