{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T02:04:55Z","timestamp":1649124295410},"reference-count":9,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,3,1]],"date-time":"1991-03-01T00:00:00Z","timestamp":667785600000},"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":8174,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1991,3]]},"DOI":"10.1016\/0304-3975(91)90207-i","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T21:44:32Z","timestamp":1034286272000},"page":"105-115","source":"Crossref","is-referenced-by-count":0,"title":["Complexity of optimal vector code generation"],"prefix":"10.1016","volume":"80","author":[{"given":"Patrick","family":"Powell","sequence":"first","affiliation":[]},{"given":"Viet","family":"Ngo","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(91)90207-I_BIB1","doi-asserted-by":"crossref","first-page":"981","DOI":"10.1109\/TC.1985.1676531","article-title":"An optimal instruction scheduling model for a class of vector processors","volume":"34","author":"Arya","year":"1985","journal-title":"IEEE Trans. Comput."},{"issue":"7","key":"10.1016\/0304-3975(91)90207-I_BIB2","first-page":"1","article-title":"Optimal chaining in expression trees","volume":"21","author":"Bernstein","year":"1986","journal-title":"Proc. Sigplan '86 Symp. on compiler construction"},{"key":"10.1016\/0304-3975(91)90207-I_BIB3","unstructured":"Cray X-MP Series Model 48 Mainframe Reference Manual, Cray Research Inc., Comput. Syst. Publ. HR-0097."},{"key":"10.1016\/0304-3975(91)90207-I_BIB4","unstructured":"Cray-2 Engineering Maintenance Manual, Cray Research Inc., Comput. Syst. Publ. CMM0200000."},{"key":"10.1016\/0304-3975(91)90207-I_BIB5","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0304-3975(91)90207-I_BIB6","first-page":"11","volume":"21","year":"1986","journal-title":"Proc. Sigplan '86 Symp. on compiler construction"},{"key":"10.1016\/0304-3975(91)90207-I_BIB7","series-title":"The Architecture of Pipelined Computers","author":"Kogge","year":"1981"},{"key":"10.1016\/0304-3975(91)90207-I_BIB8","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1145\/321607.321620","article-title":"The generation of optimal code for arithmetic expressions","volume":"17","author":"Sethi","year":"1970","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(91)90207-I_BIB9","first-page":"226","article-title":"Multiple pipeline scheduling in vector supercomputer","author":"Su","year":"1982","journal-title":"Proc. 1982 Internat. Conf. on Parallel Processing"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190207I?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190207I?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T22:21:17Z","timestamp":1555194077000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759190207I"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,3]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,3]]}},"alternative-id":["030439759190207I"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(91)90207-i","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1991,3]]}}}