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
Parents
102
James Maynard · Annals of Mathematics · 2014 · 306 citations · Full text
Arjen K. Lenstra, H. W. Lenstra, Mark S. Manasse et al. · 1990 · 282 citations · Full text
Additive number theory: the classical bases
Choice Reviews Online · 1997 · 204 citations
The multiple polynomial quadratic sieve
Robert Silverman · Mathematics of Computation · 1987 · 150 citations
1–5 of 102
139
6
h-index
4
h-index
4
h-index
3
h-index
3
h-index
1–5 of 139
81

Centre National de la Recherche Scientifique
Paris, France
5 h-index
10 publications
183 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
4 h-index
10 publications
180 citations
Centre Inria de l'Université de Lorraine
Villers-lès-Nancy, France
4 h-index
8 publications
117 citations
Université de Lorraine
Nancy, France
3 h-index
7 publications
95 citations
University of California, Berkeley
Berkeley, United States
3 h-index
5 publications
514 citations
Laboratoire Lorrain de Recherche en Informatique et ses Applications
Nancy, France
3 h-index
7 publications
122 citations
Computer Algorithms for Medicine
Graz, Austria
3 h-index
5 publications
61 citations

DEVCOM Army Research Laboratory
Adelphi, United States
2 h-index
4 publications
44 citations
1–8 of 81
MCOM · 20 publications · 825 citations
14
h-index
CRO · 4 publications · 429 citations
4
h-index
Repository · 4 publications · 79 citations
4
h-index
4 publications · 94 citations
4
h-index
4 publications · 133 citations
4
h-index
1–5