{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T02:13:20Z","timestamp":1649211200597},"reference-count":8,"publisher":"Elsevier BV","issue":"6-7","license":[{"start":{"date-parts":[[1991,9,1]],"date-time":"1991-09-01T00:00:00Z","timestamp":683683200000},"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":["Parallel Computing"],"published-print":{"date-parts":[[1991,9]]},"DOI":"10.1016\/s0167-8191(05)80058-4","type":"journal-article","created":{"date-parts":[[2005,7,14]],"date-time":"2005-07-14T14:59:21Z","timestamp":1121353161000},"page":"683-687","source":"Crossref","is-referenced-by-count":0,"title":["A faster optimal algorithm for the measure problem"],"prefix":"10.1016","volume":"17","author":[{"given":"Stephan","family":"Olariu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhaofang","family":"Wen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weixiong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(05)80058-4_bib1","series-title":"Proc. 28th Ann. Symp. on Foundations on Computer Science","first-page":"151","article-title":"Cascading divide-and-conquer: A technique for designing parallel algorithms","author":"Atallah","year":"1987"},{"key":"10.1016\/S0167-8191(05)80058-4_bib2","series-title":"Symp. on Topological Data Structures for Geographic Information Systems","first-page":"43","article-title":"Optimal algorithms for structuring geographic data","author":"Bentley","year":"1977"},{"key":"10.1016\/S0167-8191(05)80058-4_bib3","series-title":"Proc. 27th Ann. Symp. on Foundations on Computer Science","first-page":"511","article-title":"Parallel merge sort","author":"Cole","year":"1986"},{"key":"10.1016\/S0167-8191(05)80058-4_bib4","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1145\/359545.359553","article-title":"On the complexity of the measure of \u222a[ai, bi]","volume":"7","author":"Fredman","year":"1978","journal-title":"Commun. ACM"},{"key":"10.1016\/S0167-8191(05)80058-4_bib5","series-title":"Physical Design Automation of VLSI Systems","year":"1988"},{"key":"10.1016\/S0167-8191(05)80058-4_bib6","series-title":"Computational Geometry: An Introduction","author":"Preparata","year":"1989"},{"key":"10.1016\/S0167-8191(05)80058-4_bib7","series-title":"Synchronous Parallel Computation \u2014 a Survey, TR 71","author":"Vishkin","year":"1983"},{"key":"10.1016\/S0167-8191(05)80058-4_bib8","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0167-8191(90)90119-T","article-title":"An optimal speedup algorithm for the measure problem","volume":"13","author":"Zubair","year":"1990","journal-title":"Parallel Comput."}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819105800584?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819105800584?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T14:21:54Z","timestamp":1548339714000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819105800584"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,9]]},"references-count":8,"journal-issue":{"issue":"6-7","published-print":{"date-parts":[[1991,9]]}},"alternative-id":["S0167819105800584"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(05)80058-4","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1991,9]]}}}