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
Parents
79
Makoto Matsumoto, Takuji Nishimura · ACM Transactions on Modeling and Computer Simulation · 1998 · 5.7K citations
Manindra Agrawal, Neeraj Kayal, Nitin Saxena · Annals of Mathematics · 2004 · 922 citations · Full text
1–5 of 79
138
4
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 138
82
Massachusetts Institute of Technology
Cambridge, United States
3 h-index
3 publications
111 citations
University of California, Berkeley
Berkeley, United States
3 h-index
4 publications
77 citations
Département d'Informatique
Paris, France
2 h-index
4 publications
116 citations

Royal Holloway University of London
Egham, United Kingdom
2 h-index
2 publications
58 citations
Université de Montréal
Montreal, Canada
2 h-index
5 publications
155 citations
Simón Bolívar University
Caracas, Venezuela
2 h-index
3 publications
48 citations

University of Georgia
Athens, United States
2 h-index
3 publications
83 citations
University of Southern California
Los Angeles, United States
1 h-index
2 publications
214 citations
1–8 of 82
MCOM · 14 publications · 321 citations
13
h-index
6 publications · 225 citations
6
h-index
3 publications · 170 citations
3
h-index
JACM · 3 publications · 267 citations
3
h-index
3 publications · 46 citations
3
h-index
1–5