Journal Article10.1145/62065.62072
A practical sieve algorithm finding prime numbers
11
TL;DR: Based on the sieve of Eratosthenes, a faster and more compact algorithm is presented for finding all primes between 2 and N.
read more
Abstract: Based on the sieve of Eratosthenes, a faster and more compact algorithm is presented for finding all primes between 2 and N.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
An accurate computation of the hypergeometric distribution function
TL;DR: A new method is presented for computing this function that applies prime number factorization to the factorials and applies cancellation to the numerator and denominator to reduce the computational complexity of the initial, the tail end, or weighted probabilities to achieve maximum accuracy.
45
Social Play in Kaka (Nestor meridionalis) with Comparisons to Kea (Nestor notabilis)
Judy Diamond,Alan B. Bond +1 more
TL;DR: Although the two species are morphologically similar, they differ strikingly in several aspects of their ecology and social behavior, including the duration of the association between juveniles and adults, the degree of exploratory behavior, and the flexibility of their foraging strategies.
Social play in kakapo ( Strigops habroptilus ) with comparisons to kea ( Nestor notabilis ) and kaka ( Nestor meridionalis )
TL;DR: Overlapping cluster analysis of play sequences using a hypergeometric similarity metric indicated that kakapo play is generally less complex, lacking the intensity, duration, structure, and reciprocity of play in the Nestor parrots.
Load Balanced Parallel Prime Number Generator with Sieve of Eratosthenes on Cluster Computers
Soonwook Hwang,Kyusik Chung,Dongseung Kim +2 more
- 16 Oct 2007
TL;DR: It is very unlikely that the authors can compute all primes up to 20 digits even using the fastest computers in the world, so efficient parallel algorithms are developed to balance the workload of each computer, and to extend memory limit with disk storage to accommodate Giga-bytes of data.
A SCOOPP Evaluation on Packing Parallel Objects in Run-Time
João Luís Ferreira Sobral,Alberto José Proença +1 more
- 21 Jun 2000
TL;DR: This case study shows how the parallelism grain-size has a strong impact on performance and on the programmer burden and presents performance results that show that the SCOOPP methodology is feasible and the proposed policies achieve efficient portability results across several target platforms.
References
Guarded commands, nondeterminacy and formal derivation of programs
TL;DR: So-called “guarded commands” are introduced as a building block for alternative and repetitive constructs that allow nondeterministic program components for which at least the activity evoked, but possibly even the final state, is not necessarily uniquely determined by the initial state.
A linear sieve algorithm for finding prime numbers
David Gries,Jayadev Misra +1 more
TL;DR: A new algorithm is presented for finding all primes between 2 and n in time proportional to n, which has the same arithmetic complexity as the algorithm presented by Mairson.
Some new upper bounds on the generation of prime numbers
TL;DR: Use of preprocessing techniques involving space-time and additive-multiplicative tradeoffs reduces this upper bound to OA (N/log logN) and the bit complexity to O(N logN log log logLogN) bits.
34
A sublinear additive sieve for finding prime number
TL;DR: A new algorithm is presented for the problem of finding all primes between 2 and N that improves on Mairson's sieve algorithm by using a dynamic sieve technique that avoids most of the nonprimes in the range 2 to N, and byUsing a tabulation method to simulate multiplications.