Combinatorial Sieve
The *Combinatorial Sieve* is a sieve method in number theory that belongs to the class of combinatorial techniques for estimating the size of sifted sets of integers by exploiting inclusion-exclusion principles with carefully bounded remainder terms to isolate primes or almost-primes.
48
Publications
1.7K
Citations
65
Authors
48
Institutions
Publications per year
2017–2026
0
Parents
48
Arjen K. Lenstra, H. W. Lenstra, Mark S. Manasse et al. · 1990 · 282 citations · Full text
Affine linear sieve, expanders, and sum-product
Jean Bourgain, Alex Gamburd, Peter Sarnak · Inventiones mathematicae · 2009 · 172 citations · Full text
Choice Reviews Online · 2008 · 117 citations
Improved Nguyen-Vidick heuristic sieve algorithm for shortest vector problem
Xiaoyun Wang, Mingjie Liu, Chengliang Tian et al. · 2011 · 76 citations
1–5 of 48
65
3
h-index
3
h-index
2
h-index
2
h-index
Rutgers, The State University of New Jersey, United States
2 publications · 72 citations
2
h-index
1–5 of 65
48

Royal Holloway University of London
Egham, United Kingdom
4 h-index
4 publications
145 citations
Universität Ulm
Ulm, Germany
3 h-index
3 publications
67 citations
Princeton University
Princeton, United States
2 h-index
2 publications
189 citations
Jesus University
Jeonju, South Korea
2 h-index
2 publications
40 citations
Georgia Institute of Technology
Atlanta, United States
2 h-index
4 publications
44 citations

The University of Queensland
Brisbane, Australia
2 h-index
2 publications
87 citations

University of Toronto
Toronto, Canada
2 h-index
2 publications
60 citations
University of California System
Oakland, United States
2 h-index
2 publications
335 citations
1–8 of 48
6 publications · 123 citations
6
h-index
4 publications · 98 citations
4
h-index
2 publications · 41 citations
2
h-index
2 publications · 63 citations
2
h-index
1 publications · 33 citations
1
h-index
1–5