{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,19]],"date-time":"2023-08-19T01:23:05Z","timestamp":1692408185009},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1996,7,1]],"date-time":"1996-07-01T00:00:00Z","timestamp":836179200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1996,7]]},"DOI":"10.1016\/0020-0190(96)00076-2","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:55:41Z","timestamp":1052769341000},"page":"45-51","source":"Crossref","is-referenced-by-count":10,"title":["A frame for general divide-and-conquer recurrences"],"prefix":"10.1016","volume":"59","author":[{"given":"Wang","family":"Xiaodong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fu","family":"Qingxiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(96)00076-2_BIB1","series-title":"Data Structures and Algorithms","author":"Aho","year":"1983"},{"key":"10.1016\/0020-0190(96)00076-2_BIB2","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1145\/1008861.1008865","article-title":"A general method for solving divide-and-conquer recurrence","volume":"12","author":"Bentley","year":"1980","journal-title":"SIGACT News"},{"key":"10.1016\/0020-0190(96)00076-2_BIB3","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1137\/0213028","article-title":"Constant depth reducibility","volume":"13","author":"Chandra","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(96)00076-2_BIB4","series-title":"Introduction to Algorithms","author":"Cormen","year":"1990"},{"key":"10.1016\/0020-0190(96)00076-2_BIB5","series-title":"Proc. ACM Symp. on Computational Geometry","article-title":"An efficient output-sensitive hiddensurface removal algorithm and its parallelization","author":"Reif","year":"1988"},{"key":"10.1016\/0020-0190(96)00076-2_BIB6","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1006\/jagm.1994.1004","article-title":"A general method and a master theorem for divide-and-conquer recurrences with applications","volume":"16","author":"Verma","year":"1994","journal-title":"J. Algorithms"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096000762?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096000762?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T14:52:40Z","timestamp":1555944760000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019096000762"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,7]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,7]]}},"alternative-id":["0020019096000762"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(96)00076-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1996,7]]}}}