{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T08:31:09Z","timestamp":1777105869197,"version":"3.51.4"},"reference-count":16,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"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":10424,"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":[[1985]]},"DOI":"10.1016\/0167-6423(85)90003-6","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T16:44:35Z","timestamp":1048610675000},"page":"37-58","source":"Crossref","is-referenced-by-count":54,"special_numbering":"C","title":["The design of divide and conquer algorithms"],"prefix":"10.1016","volume":"5","author":[{"given":"Douglas R.","family":"Smith","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6423(85)90003-6_BIB1","series-title":"Data Structures and Algorithms","author":"Aho","year":"1983"},{"key":"10.1016\/0167-6423(85)90003-6_BIB2","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1145\/358841.358850","article-title":"Multidimensional divide and conquer","volume":"23","author":"Bentley","year":"1980","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-6423(85)90003-6_BIB3","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1093\/comjnl\/23.1.61","article-title":"Algorithm classification through synthesis","volume":"23","author":"Clark","year":"1980","journal-title":"Comput. J."},{"key":"10.1016\/0167-6423(85)90003-6_BIB4","series-title":"Proc. Colloques IRIA on Proving and Improving Programs","article-title":"On automating structured programming","author":"Dershowitz","year":"1975"},{"key":"10.1016\/0167-6423(85)90003-6_BIB5","series-title":"Report No. UIUCDCS-R-81-1011","article-title":"The evolution of programs: program abstraction and instantiation","author":"Dershowitz","year":"1981"},{"key":"10.1016\/0167-6423(85)90003-6_BIB6","series-title":"Structured Programming","article-title":"Notes on structured programming","author":"Dijkstra","year":"1972"},{"key":"10.1016\/0167-6423(85)90003-6_BIB7","series-title":"Proc. International Conference on Reliable Software","first-page":"88","article-title":"Knowledge about programs: a model and case study","author":"Gerhart","year":"1975"},{"key":"10.1016\/0167-6423(85)90003-6_BIB8","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1109\/TSE.1976.233834","article-title":"Control structure abstractions of the backtrack programming technique","volume":"2","author":"Gerhart","year":"1976","journal-title":"IEEE Trans. Software Engrg."},{"key":"10.1016\/0167-6423(85)90003-6_BIB9","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0004-3702(78)80016-2","article-title":"On program synthesis knowledge","volume":"10","author":"Green","year":"1978","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0167-6423(85)90003-6_BIB10","series-title":"Algorithms","author":"Sedgewick","year":"1983"},{"key":"10.1016\/0167-6423(85)90003-6_BIB11","series-title":"Proc. 6th Conference on Automated Deduction","first-page":"172","article-title":"Derived preconditions and their use in program synthesis","volume":"138","author":"Smith","year":"1982"},{"key":"10.1016\/0167-6423(85)90003-6_BIB12","series-title":"Technical Report NPS 52-83-002","article-title":"The structure of divide and conquer algorithms","author":"Smith","year":"1983"},{"key":"10.1016\/0167-6423(85)90003-6_BIB13","series-title":"Proc. 8th International Joint Conference on Artificial Intelligence","first-page":"32","article-title":"A problem reduction approach to program synthesis","author":"Smith","year":"1983"},{"key":"10.1016\/0167-6423(85)90003-6_BIB14_1","article-title":"Top-down synthesis of simple divide and conquer algorithms","author":"Smith","year":"1983"},{"key":"10.1016\/0167-6423(85)90003-6_BIB14_2","series-title":"Technical Report NPS 52-82-011","year":"1982"},{"key":"10.1016\/0167-6423(85)90003-6_BIB15","series-title":"Proc. ACM Symposium on Artificial Intelligence and Programming Languages","first-page":"13","article-title":"Abstractions, instantiations and proofs of marking algorithms","author":"Yelowitz","year":"1977"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642385900036?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642385900036?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T15:50:04Z","timestamp":1553442604000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167642385900036"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"references-count":16,"alternative-id":["0167642385900036"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(85)90003-6","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1985]]}}}