{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T06:03:25Z","timestamp":1709273005501},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,3,1]],"date-time":"1989-03-01T00:00:00Z","timestamp":604713600000},"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":["Journal of Algorithms"],"published-print":{"date-parts":[[1989,3]]},"DOI":"10.1016\/0196-6774(89)90027-8","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T03:44:36Z","timestamp":1108007076000},"page":"120-139","source":"Crossref","is-referenced-by-count":8,"title":["Approximation algorithms for scheduling arithmetic expressions on pipelined machines"],"prefix":"10.1016","volume":"10","author":[{"given":"David","family":"Bernstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Rodeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Izidor","family":"Gertner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(89)90027-8_BIB1","article-title":"Computing Expressions on a Pipelined Processor with a Small Number of Stages","author":"Bernstein","year":"1986"},{"issue":"No. 4","key":"10.1016\/0196-6774(89)90027-8_BIB2","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1109\/TC.1980.1675569","article-title":"Deterministic scheduling with pipelined processors","author":"Bruno","year":"1980","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0196-6774(89)90027-8_BIB3","series-title":"Computer and Job-Shop Scheduling Theory","author":"Coffman","year":"1976"},{"key":"10.1016\/0196-6774(89)90027-8_BIB4","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/BF00288685","article-title":"Optimal scheduling for two-processor systems","volume":"1","author":"Coffman","year":"1972","journal-title":"Acta Inform."},{"key":"10.1016\/0196-6774(89)90027-8_BIB5","first-page":"1","article-title":"On a class of scheduling algorithms for multiprocessors computing systems","volume":"Vol 24","author":"Chen","year":"1975"},{"issue":"No. 6","key":"10.1016\/0196-6774(89)90027-8_BIB6","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1287\/opre.9.6.841","article-title":"Parallel sequencing and assembly line problems","volume":"9","author":"Hu","year":"1961","journal-title":"Oper. Res."},{"key":"10.1016\/0196-6774(89)90027-8_BIB7","series-title":"Computer Architecture and Parallel Processing","author":"Hwang","year":"1984"},{"issue":"No. 3","key":"10.1016\/0196-6774(89)90027-8_BIB8","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1145\/2166.357217","article-title":"Postpass code optimization of pipeline constraints","volume":"5","author":"Hennessy","year":"1983","journal-title":"ACM Trans. Programming Lang. Systems"},{"key":"10.1016\/0196-6774(89)90027-8_BIB9","series-title":"The Architecture of Pipelined Computers","author":"Kogge","year":"1981"},{"issue":"No. 11","key":"10.1016\/0196-6774(89)90027-8_BIB10","doi-asserted-by":"crossref","first-page":"1101","DOI":"10.1109\/TC.1977.1674756","article-title":"Scheduling trees in parallel\/pipelined processing environments","author":"Li","year":"1977","journal-title":"IEEE Trans. Comput."},{"issue":"No. 3","key":"10.1016\/0196-6774(89)90027-8_BIB11","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1137\/0206037","article-title":"Worst case analysis of two scheduling algorithms","volume":"6","author":"Lam","year":"1977","journal-title":"SIAM J. Comput."},{"issue":"No. 1","key":"10.1016\/0196-6774(89)90027-8_BIB12","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1145\/2465.214917","article-title":"Reduced instruction set computers","volume":"28","author":"Paterson","year":"1985","journal-title":"Comm. ACM"},{"issue":"No. 1","key":"10.1016\/0196-6774(89)90027-8_BIB13","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/359327.359336","article-title":"The Cray-1 computer system","volume":"21","author":"Russell","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0196-6774(89)90027-8_BIB14","series-title":"Computer and Job-Shop Scheduling Theory","first-page":"51","article-title":"Algorithms for minimal length schedules","author":"Sethi","year":"1976"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677489900278?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677489900278?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T01:54:59Z","timestamp":1548726899000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677489900278"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,3]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,3]]}},"alternative-id":["0196677489900278"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(89)90027-8","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1989,3]]}}}