SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Information Processing Letters

Volumn 59, Issue 2, 1996, Pages 79-84

A space-efficient fast prime number sieve

(3) Dunten, Brian a Jones, Julie a Sorenson, Jonathan a

a BUTLER UNIVERSITY (United States)

Author keywords

Analysis of algorithms; Design of algorithms; Number theoretic algorithms; Prime number sieve; Sieve of eratosthenes

Indexed keywords

EID: 1642643931 PISSN: 00200190 EISSN: None Source Type: Journal
DOI: 10.1016/0020-0190(96)00099-3 Document Type: Article

Times cited : (12)

References (15)

1
- 0018507041
- An experiment in knowledge-based automatic programming
- D.R. Barstow, An experiment in knowledge-based automatic programming, Artificial Intelligence 12 (1979) 73-119.
- (1979) Artificial Intelligence , vol.12 , pp. 73-119
- Barstow, D.R.¹

2
- 0039759374
- The segmented sieve of Eratosthenes and primes in arithmetic progressions to 1012
- C. Bays and R. Hudson, The segmented sieve of Eratosthenes and primes in arithmetic progressions to 1012, BIT 17 (1977) 121-127.
- (1977) BIT , vol.17 , pp. 121-127
- Bays, C.¹ Hudson, R.²

3
- 0022719798
- An incremental primal sieve
- S. Bengelloun, An incremental primal sieve, Acta Inform. 23 (2) (1986) 119-125.
- (1986) Acta Inform. , vol.23 , Issue.2 , pp. 119-125
- Bengelloun, S.¹

4
- 13044307756
- MacMillan, New York
- M.L. D'ooge, F.E. Robbins and L.C. Karpinski, Nicomachus of Gerasa: Introduction to Arithmetic (MacMillan, New York, 1926); University of Michigan Studies Humanistic Series, Vol. 16.
- (1926) Nicomachus of Gerasa: Introduction to Arithmetic
- D'ooge, M.L.¹ Robbins, F.E.² Karpinski, L.C.³

5
- 30244565963
- M.L. D'ooge, F.E. Robbins and L.C. Karpinski, Nicomachus of Gerasa: Introduction to Arithmetic (MacMillan, New York, 1926); University of Michigan Studies Humanistic Series, Vol. 16.
- University of Michigan Studies Humanistic Series , vol.16

6
- 0018057224
- A linear sieve algorithm for finding prime numbers
- D. Gries and J. Misra, A linear sieve algorithm for finding prime numbers, Comm. ACM 21 (12) (1978) 999-1003.
- (1978) Comm. ACM , vol.21 , Issue.12 , pp. 999-1003
- Gries, D.¹ Misra, J.²

7
- 0003766834
- Oxford University Press, Oxford, 5th ed.
- G.H. Hardy and E.M. Wright, An Introduction to the Theory of Numbers (Oxford University Press, Oxford, 5th ed., 1979).
- (1979) An Introduction to the Theory of Numbers
- Hardy, G.H.¹ Wright, E.M.²

8
- 0003657590
- Addison-Wesley, Reading, MA, 2nd ed.
- D.E. Knuth, The Art of Computer Programming: Seminumerical Algorithms, Vol. 2 (Addison-Wesley, Reading, MA, 2nd ed., 1981).
- (1981) The Art of Computer Programming: Seminumerical Algorithms , vol.2
- Knuth, D.E.¹

9
- 0040234050
- A sublinear additive sieve for finding prime numbers
- P. Pritchard, A sublinear additive sieve for finding prime numbers, Comm. ACM 24 (1) (1981) 18-23, 772.
- (1981) Comm. ACM , vol.24 , Issue.1 , pp. 18-23
- Pritchard, P.¹

10
- 1642628242
- Explaining the wheel sieve
- P. Pritchard, Explaining the wheel sieve, Acta Inform. 17 (1982) 477-485.
- (1982) Acta Inform. , vol.17 , pp. 477-485
- Pritchard, P.¹

11
- 0038984685
- Fast compact prime number sieves (among others)
- P. Pritchard, Fast compact prime number sieves (among others), J. Algorithms 4 (1983) 332-344.
- (1983) J. Algorithms , vol.4 , pp. 332-344
- Pritchard, P.¹

12
- 0023401229
- Linear prime-number sieves: A family tree
- P. Pritchard, Linear prime-number sieves: A family tree, Sci. Comput. Programming 9 (1987) 17-35.
- (1987) Sci. Comput. Programming , vol.9 , pp. 17-35
- Pritchard, P.¹

13
- 84994230220
- Improved incremental prime number sieves
- L.M. Adleman and M.-D. Huang, eds., Lecture Notes in Computer Science 877 Springer, Berlin
- P. Pritchard, Improved incremental prime number sieves, in: L.M. Adleman and M.-D. Huang, eds., Proc. 1st Internat. Algorithmic Number Theory Symp. (ANTS-1), Lecture Notes in Computer Science 877 (Springer, Berlin, 1994) 280-288.
- (1994) Proc. 1st Internat. Algorithmic Number Theory Symp. (ANTS-1) , pp. 280-288
- Pritchard, P.¹

14
- 38149143955
- Two fast GCD algorithms
- J. Sorenson, Two fast GCD algorithms, J. Algorithms 16 (1994) 110-144.
- (1994) J. Algorithms , vol.16 , pp. 110-144
- Sorenson, J.¹

15
- 12344274655
- Two fast parallel prime number sieves
- J. Sorenson and I. Parberry, Two fast parallel prime number sieves, Inform. and Comput. 144 (1) (1994) 115-130.
- (1994) Inform. and Comput. , vol.144 , Issue.1 , pp. 115-130
- Sorenson, J.¹ Parberry, I.²

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.