{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T09:22:12Z","timestamp":1776763332244,"version":"3.51.2"},"reference-count":19,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1983,4,1]],"date-time":"1983-04-01T00:00:00Z","timestamp":418003200000},"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":11065,"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":[[1983,4]]},"DOI":"10.1016\/0167-6423(83)90003-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:09:22Z","timestamp":1027642162000},"page":"37-63","source":"Crossref","is-referenced-by-count":3,"title":["A case study of number-theoretic computation: searching for primes in arithmetic progression"],"prefix":"10.1016","volume":"3","author":[{"given":"Paul A.","family":"Pritchard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"11","key":"10.1016\/0167-6423(83)90003-5_BIB1","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1145\/359842.359859","article-title":"A fast string searching algorithm","volume":"20","author":"Boyer","year":"1977","journal-title":"Comm. ACM"},{"issue":"2","key":"10.1016\/0167-6423(83)90003-5_BIB2_1","first-page":"15","article-title":"There exist an infinity of 3-combinations of primes in A.P.","volume":"6","author":"Chowla","year":"1944","journal-title":"Proc. Lahore Philos. Soc."},{"issue":"2","key":"10.1016\/0167-6423(83)90003-5_BIB2_2","first-page":"16","article-title":"There exists an infinity of 3-combinations of primes in A.P.","volume":"6","author":"Chowla","year":"1944","journal-title":"Proc. Lahore Philos. Soc."},{"key":"10.1016\/0167-6423(83)90003-5_BIB3","volume":"Vol. 1","author":"Dickson","year":"1971"},{"key":"10.1016\/0167-6423(83)90003-5_BIB4","series-title":"A Disciplilne of Programming","author":"Dijkstra","year":"1976"},{"key":"10.1016\/0167-6423(83)90003-5_BIB5","series-title":"The Science of Programming","author":"Gries","year":"1981"},{"key":"10.1016\/0167-6423(83)90003-5_BIB6","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0022-314X(82)90055-5","article-title":"Arithmetic progressions that consist only of primes","volume":"14","author":"Grosswald","year":"1982","journal-title":"J. Number Theory"},{"issue":"148","key":"10.1016\/0167-6423(83)90003-5_BIB7","doi-asserted-by":"crossref","first-page":"1343","DOI":"10.1090\/S0025-5718-1979-0537981-9","article-title":"Arithmetic progressions consisting only of primes","volume":"33","author":"Grosswald","year":"1979","journal-title":"Math. Computation"},{"key":"10.1016\/0167-6423(83)90003-5_BIB8","series-title":"Unsolved Problems in Number Theory","author":"Guy","year":"1981"},{"key":"10.1016\/0167-6423(83)90003-5_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02403921","article-title":"Some problems of \u201cpartitio numerorum\u201d III: on the expression of a number as a sum of primes","volume":"44","author":"Hardy","year":"1923","journal-title":"Acta Mathematica"},{"key":"10.1016\/0167-6423(83)90003-5_BIB10","series-title":"An Introduction to the Theory of Numbers","author":"Hardy","year":"1979"},{"issue":"3","key":"10.1016\/0167-6423(83)90003-5_BIB11","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1112\/jlms\/s2-23.3.396","article-title":"Three primes and an almost prime in arithmetic progression","volume":"23","author":"Heath-Brown","year":"1981","journal-title":"J. London Math. Soc. (2nd series)"},{"key":"10.1016\/0167-6423(83)90003-5_BIB12","series-title":"The Art of Computer Programming, Vol. 2: Seminumerical Algorithms","author":"Knuth","year":"1981"},{"key":"10.1016\/0167-6423(83)90003-5_BIB13","series-title":"Topics in Number Theory, Vols. 1 and 2","author":"Le Veque","year":"1956"},{"issue":"1","key":"10.1016\/0167-6423(83)90003-5_BIB14","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(83)90003-5_BIB15","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(83)90003-5_BIB16","doi-asserted-by":"crossref","unstructured":"P. Pritchard, Fast compact prime-number sieves (among others), J. Algorithms, to appear.","DOI":"10.1016\/0196-6774(83)90014-7"},{"key":"10.1016\/0167-6423(83)90003-5_BIB17","first-page":"239","article-title":"Primes in arithmetic progression","volume":"17","author":"Weintraub","year":"1977","journal-title":"B.I.T."},{"issue":"140","key":"10.1016\/0167-6423(83)90003-5_BIB18","doi-asserted-by":"crossref","first-page":"1030","DOI":"10.1090\/S0025-5718-1977-0441849-4","article-title":"Seventeen primes in arithmetic progression","volume":"31","author":"Weintraub","year":"1977","journal-title":"Math. Computation"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642383900035?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642383900035?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T13:50:06Z","timestamp":1555077006000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167642383900035"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,4]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1983,4]]}},"alternative-id":["0167642383900035"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(83)90003-5","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1983,4]]}}}