{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T17:30:29Z","timestamp":1648920629281},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1989,7,1]],"date-time":"1989-07-01T00:00:00Z","timestamp":615254400000},"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":[[1989,7]]},"DOI":"10.1016\/0020-0190(89)90031-8","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:20:15Z","timestamp":1027657215000},"page":"57-60","source":"Crossref","is-referenced-by-count":3,"title":["A parallel circle-cover minimization algorithm"],"prefix":"10.1016","volume":"32","author":[{"given":"Laurence","family":"Boxer","sequence":"first","affiliation":[]},{"given":"Russ","family":"Miller","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(89)90031-8_BIB1","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0020-0190(88)90068-3","article-title":"Parallel circle-cover algorithms","volume":"27","author":"Bertossi","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(89)90031-8_BIB2","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1137\/0217049","article-title":"Parallel merge sort","volume":"17","author":"Cole","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(89)90031-8_BIB3","series-title":"Report No. UCB\/CSD 88\/408","article-title":"A Survey of Parallel Algorithms for Shared Memory Machines","author":"Karp","year":"1988"},{"key":"10.1016\/0020-0190(89)90031-8_BIB4","first-page":"180","article-title":"The power of parallel prefix","author":"Kruskal","year":"1985","journal-title":"Proc. 1985 Internat. Conf. on Parallel Processing"},{"key":"10.1016\/0020-0190(89)90031-8_BIB5","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0020-0190(84)90033-4","article-title":"On a cover-circle minimization problem","volume":"18","author":"Lee","year":"1984","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(89)90031-8_BIB6","series-title":"Ph.D. Dissertation","article-title":"The Complexity of Parallel Computations","author":"Wyllie","year":"1981"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019089900318?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019089900318?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T12:53:53Z","timestamp":1555073633000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019089900318"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,7]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,7]]}},"alternative-id":["0020019089900318"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(89)90031-8","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1989,7]]}}}