{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T08:38:20Z","timestamp":1776760700563,"version":"3.51.2"},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1987,8,1]],"date-time":"1987-08-01T00:00:00Z","timestamp":554774400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9482,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[1987,8]]},"DOI":"10.1016\/0167-6423(87)90024-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:09:22Z","timestamp":1027656562000},"page":"17-35","source":"Crossref","is-referenced-by-count":21,"title":["Linear prime-number sieves: A family tree"],"prefix":"10.1016","volume":"9","author":[{"given":"Paul","family":"Pritchard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6423(87)90024-4_BIB1","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0004-3702(79)90013-4","article-title":"An experiment in knowledge-based automatic programming","volume":"12","author":"Barstow","year":"1979","journal-title":"Artificial Intelligence"},{"issue":"2","key":"10.1016\/0167-6423(87)90024-4_BIB2","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/BF00289493","article-title":"An incremental primal sieve","volume":"23","author":"Bengalloun","year":"1986","journal-title":"Acta Informat."},{"key":"10.1016\/0167-6423(87)90024-4_BIB3","first-page":"558","article-title":"On the number of positive integers \u2a7dx all of whose prime factors are \u2a7dy","volume":"6","author":"Chowla","year":"1955","journal-title":"Proc. Amer. Math. Soc."},{"issue":"12","key":"10.1016\/0167-6423(87)90024-4_BIB4","doi-asserted-by":"crossref","first-page":"999","DOI":"10.1145\/359657.359660","article-title":"A linear sieve algorithm for finding prime numbers","volume":"21","author":"Gries","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-6423(87)90024-4_BIB5","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1515\/dema-1978-0121","article-title":"On the problem of Jacobsthal","volume":"11","author":"Iwaniec","year":"1978","journal-title":"Demonstratio Math."},{"issue":"9","key":"10.1016\/0167-6423(87)90024-4_BIB6","doi-asserted-by":"crossref","first-page":"664","DOI":"10.1145\/359810.359838","article-title":"Some new upper bounds on the generation of prime numbers","volume":"20","author":"Mairson","year":"1977","journal-title":"Comm. ACM"},{"issue":"2","key":"10.1016\/0167-6423(87)90024-4_BIB7","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0020-0190(79)90148-0","article-title":"Space-time tradeoff in implementing certain set operations","volume":"8","author":"Misra","year":"1979","journal-title":"Inform. Proc. Letters"},{"key":"10.1016\/0167-6423(87)90024-4_BIB8","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1145\/357121.357128","article-title":"An exercise in program explanation","volume":"3","author":"Misra","year":"1981","journal-title":"ACM Trans. Program. Language Systems"},{"key":"10.1016\/0167-6423(87)90024-4_BIB9","series-title":"CGOL\u2014an algebraic notation for MACLISP users","author":"Pratt","year":"1977"},{"issue":"1","key":"10.1016\/0167-6423(87)90024-4_BIB10","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/358527.358540","article-title":"A sublinear additive sieve for finding prime numbers","volume":"24","author":"Pritchard","year":"1981","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-6423(87)90024-4_BIB11","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF00289592","article-title":"Another look at the \u2018longest ascending subsequence\u2019 problem","volume":"16","author":"Pritchard","year":"1981","journal-title":"Acta Informat."},{"key":"10.1016\/0167-6423(87)90024-4_BIB12","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1007\/BF00264164","article-title":"Explaining the wheel sieve","volume":"17","author":"Pritchard","year":"1982","journal-title":"Acta Informat."},{"key":"10.1016\/0167-6423(87)90024-4_BIB13","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1016\/0196-6774(83)90014-7","article-title":"Fast compact prime-number sieves (among others)","volume":"4","author":"Pritchard","year":"1983","journal-title":"J. Algorithms"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642387900244?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642387900244?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,15]],"date-time":"2021-05-15T01:01:06Z","timestamp":1621040466000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167642387900244"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,8]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1987,8]]}},"alternative-id":["0167642387900244"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(87)90024-4","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1987,8]]}}}