{"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":1776760700562,"version":"3.51.2"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1986,5,1]],"date-time":"1986-05-01T00:00:00Z","timestamp":515289600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1986,5]]},"DOI":"10.1007\/bf00289493","type":"journal-article","created":{"date-parts":[[2004,10,4]],"date-time":"2004-10-04T23:55:13Z","timestamp":1096934113000},"page":"119-125","source":"Crossref","is-referenced-by-count":10,"title":["An incremental primal sieve"],"prefix":"10.1007","volume":"23","author":[{"given":"S. A.","family":"Bengelloun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A.V. Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Reading, MA: Addison-Wesley 1974"},{"key":"CR2","unstructured":"Bengelloun, S.A.: Balancing for Fixed Sequence Incremental Problems. (To be submitted for publication)"},{"key":"CR3","unstructured":"Bengelloun, S.A.: An Incremental Evaluator. (In preparation)"},{"key":"CR4","unstructured":"Bengelloun, S.A.: A New Variation on a Scheme of Eratosthenes. Technical Report, Dept. of Mathematics and Computer Science, Mahammad V University, Rabat, Morocco"},{"key":"CR5","first-page":"257","volume-title":"Automata, Languages, and Programming","author":"D. Friedman","year":"1976","unstructured":"Friedman, D., Wise, D.: CONS Should Not Evaluate Its Arguments. In: Automata, Languages, and Programming, pp. 257?284. Edinburgh: University Press 1976"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"999","DOI":"10.1145\/359657.359660","volume":"21","author":"D. Gries","year":"1978","unstructured":"Gries, D., Misra, J.: A Linear Sieve Algorithm for Finding Prime Numbers. Commun. A. C. M. 21, 999?1003 (1978)","journal-title":"Commun. A. C. M."},{"key":"CR7","volume-title":"An Introduction to the Theory of Numbers","author":"G.H. Hardy","year":"1960","unstructured":"Hardy, G.H., Wright, E.M.: An Introduction to the Theory of Numbers. New York: Oxford University Press 1960"},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"Henderson, P., Morris, J. (Jr.): A Lazy Evaluator. In Third Annual Symposium on Principles of Programming Languages, pp. 95?103. Association for Computing Machinery 1976","DOI":"10.1145\/800168.811543"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"664","DOI":"10.1145\/359810.359838","volume":"20","author":"H.G. Mairson","year":"1977","unstructured":"Mairson, H.G.: Some New Upper Bounds on the Generation of Prime Numbers. Commun. ACM 20, 664?669 (1977)","journal-title":"Commun. ACM"},{"key":"CR10","unstructured":"Monier, L.: Algorithmes de Factorisation d'Entiers. PhD Thesis, l'Universite Paris-Sud, Centre d'Orsay, 1980"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/358527.358540","volume":"24","author":"P. Pritchard","year":"1981","unstructured":"Pritchard, P.: A Sublinear Additive Sieve for Finding Prime Numbers. Commun. ACM 24, 18?23 (1981)","journal-title":"Commun. ACM"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289493.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00289493\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289493","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T17:14:54Z","timestamp":1554743694000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00289493"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,5]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1986,5]]}},"alternative-id":["BF00289493"],"URL":"https:\/\/doi.org\/10.1007\/bf00289493","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,5]]}}}