{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T12:02:53Z","timestamp":1759147373794},"reference-count":16,"publisher":"Elsevier BV","issue":"1-5","license":[{"start":{"date-parts":[[1987,8,1]],"date-time":"1987-08-01T00:00:00Z","timestamp":554774400000},"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":["Microprocessing and Microprogramming"],"published-print":{"date-parts":[[1987,8]]},"DOI":"10.1016\/0165-6074(87)90093-7","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T17:14:48Z","timestamp":1062609288000},"page":"577-584","source":"Crossref","is-referenced-by-count":12,"title":["Automated datapath synthesis: a compilation approach"],"prefix":"10.1016","volume":"21","author":[{"given":"Peter","family":"Pfahler","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0165-6074(87)90093-7_BIB1","series-title":"Introduction to sequencing and scheduling","author":"Baker","year":"1974"},{"key":"10.1016\/0165-6074(87)90093-7_BIB2","unstructured":"Chaitin, G.J. \u201cRegister Allocation via Coloring\u201d, IBM Research Report RC8395 8\/4\/80"},{"key":"10.1016\/0165-6074(87)90093-7_BIB3","article-title":"Faltung von Datenflu\u03b2graphen zur Synthese von Prozessornetzweken","author":"Ewering","year":"1986"},{"issue":"4","key":"10.1016\/0165-6074(87)90093-7_BIB4","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1137\/0204035","article-title":"Complexity Results for Multiprocessor Scheduling under Resource Constraintss","volume":"4","author":"Garey","year":"1975","journal-title":"SIAM J. Computing"},{"key":"10.1016\/0165-6074(87)90093-7_BIB5","series-title":"Algorithmic Graph Theory","author":"Golumbic","year":"1980"},{"issue":"No. 2","key":"10.1016\/0165-6074(87)90093-7_BIB6","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1109\/TC.1982.1675955","article-title":"Automated synthesis of digital hardware","author":"Hafer","year":"1982","journal-title":"IEEE Transactions on computers"},{"issue":"6","key":"10.1016\/0165-6074(87)90093-7_BIB7","doi-asserted-by":"crossref","DOI":"10.1287\/opre.9.6.841","article-title":"Parallel sequencing and assembly line problems","volume":"9","author":"Hu","year":"1961","journal-title":"Operations Research"},{"key":"10.1016\/0165-6074(87)90093-7_BIB8","series-title":"Proc. 23rd Design Automation Conference","article-title":"A new synthesis algorithm for the MIMOLA software system","author":"Marwedel","year":"1986"},{"key":"10.1016\/0165-6074(87)90093-7_BIB9","series-title":"Deterministische Strategie zum Scheduling von Taskabh\u00e4ngigkitissrukturen","author":"Nett","year":"1979"},{"key":"10.1016\/0165-6074(87)90093-7_BIB10","series-title":"Proc. 23rd Design Automation Conference","first-page":"263","article-title":"HAL: A Multi-Paradigm Approach to Automatic Data Path Design","author":"Paulin","year":"1986"},{"key":"10.1016\/0165-6074(87)90093-7_BIB11","series-title":"Proc. 23rd Design Automation Conference","first-page":"461","article-title":"MAHA : A Program for Datapath Synthesis","author":"Parker","year":"1986"},{"issue":"2","key":"10.1016\/0165-6074(87)90093-7_BIB12","first-page":"54","article-title":"On Arithmetic Expression and Trees","volume":"12","author":"Redzeijowski","year":"1969","journal-title":"CACM"},{"key":"10.1016\/0165-6074(87)90093-7_BIB13","series-title":"VLSI: Algorithms and Architectures","first-page":"49","article-title":"Parallelism in Space-Time Tradeoffs","author":"Savage","year":"1985"},{"key":"10.1016\/0165-6074(87)90093-7_BIB14","series-title":"Proc. 20th Design Automation Conference 1983","first-page":"490","article-title":"Facet : A Procedure for the Automated Synthesis of Digital Systems","author":"Tseng","year":"1976"},{"key":"10.1016\/0165-6074(87)90093-7_BIB15","series-title":"Compiler Construction: An advanced course","article-title":"Code Generation","volume":"21","author":"Waite","year":"1976"},{"issue":"4","key":"10.1016\/0165-6074(87)90093-7_BIB16","doi-asserted-by":"crossref","first-page":"950","DOI":"10.1145\/4221.4228","article-title":"A Polynomial Algorithm for the Min-Cut Linear Arrangement of trees","volume":"32","author":"Yannakakis","journal-title":"JACM"}],"container-title":["Microprocessing and Microprogramming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0165607487900937?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0165607487900937?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T09:51:01Z","timestamp":1551088261000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0165607487900937"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,8]]},"references-count":16,"journal-issue":{"issue":"1-5","published-print":{"date-parts":[[1987,8]]}},"alternative-id":["0165607487900937"],"URL":"https:\/\/doi.org\/10.1016\/0165-6074(87)90093-7","relation":{},"ISSN":["0165-6074"],"issn-type":[{"value":"0165-6074","type":"print"}],"subject":[],"published":{"date-parts":[[1987,8]]}}}