{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:30:39Z","timestamp":1757626239468,"version":"3.44.0"},"reference-count":18,"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":[[1991,3,1]],"date-time":"1991-03-01T00:00:00Z","timestamp":667785600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Integration"],"published-print":{"date-parts":[[1991,3]]},"DOI":"10.1016\/0167-9260(91)90006-7","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T14:37:33Z","timestamp":1047652653000},"page":"43-66","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"title":["FLORA: A data path allocator based on branch-and-bound search"],"prefix":"10.1016","volume":"11","author":[{"given":"Ta-Yung","family":"Liu","sequence":"first","affiliation":[]},{"given":"Youn-Long","family":"Lin","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-9260(91)90006-7_BIB1","series-title":"25th ACM\/IEEE Design Automation Conference","first-page":"330","article-title":"Tutorial on high-level synthesis","author":"McFarland","year":"1988"},{"year":"1988","series-title":"Silicon Compilation","key":"10.1016\/0167-9260(91)90006-7_BIB2"},{"issue":"3","key":"10.1016\/0167-9260(91)90006-7_BIB3","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1109\/TCAD.1986.1270207","article-title":"Automated synthesis of data paths in digital systems","volume":"5","author":"Tseng","year":"1986","journal-title":"IEEE Trans. on CAD"},{"key":"10.1016\/0167-9260(91)90006-7_BIB4","series-title":"23rd ACM\/IEEE Design Automation Conference","first-page":"263","article-title":"HAL: A multi-paradigm approach to automatic data path synthesis","author":"Paulin","year":"1986"},{"key":"10.1016\/0167-9260(91)90006-7_BIB5","series-title":"8th ACM\/IEEE Design Automation Workshop","first-page":"155","article-title":"Wire routing by optimizing channel assignment within large apertures","author":"Hashimoto","year":"1971"},{"key":"10.1016\/0167-9260(91)90006-7_BIB6","series-title":"24th ACM\/IEEE Design Automation Conference","first-page":"210","article-title":"REAL: A program for REgister ALlocation","author":"Kurdahi","year":"1987"},{"key":"10.1016\/0167-9260(91)90006-7_BIB7","series-title":"23rd ACM\/IEEE Design Automation Conference","first-page":"461","article-title":"MAHA: A program for data path synthesis","author":"Parker","year":"1986"},{"issue":"3","key":"10.1016\/0167-9260(91)90006-7_BIB8","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1109\/43.3169","article-title":"Sehwa: A software package for synthesis of pipelines from behavioral specifcations","volume":"7","author":"Park","year":"1988","journal-title":"IEEE Trans. on CAD"},{"issue":"6","key":"10.1016\/0167-9260(91)90006-7_BIB9","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1109\/TCAD.1987.1270350","article-title":"Design tools for intelligent silicon compilation","volume":"6","author":"Pangrle","year":"1987","journal-title":"IEEE Trans. on CAD"},{"key":"10.1016\/0167-9260(91)90006-7_BIB10","first-page":"536","article-title":"Splicer: A heuristic approach to connectivity binding","author":"Pangrle","year":"1988"},{"issue":"4","key":"10.1016\/0167-9260(91)90006-7_BIB11","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1109\/43.29596","article-title":"Architectural synthesis for DSP silicon compiler","volume":"8","author":"Haroun","year":"1989","journal-title":"IEEE Trans. on CAD"},{"key":"10.1016\/0167-9260(91)90006-7_BIB12","series-title":"27th ACM\/IEEE Design Automation Conference","first-page":"499","article-title":"Data path allocation based on bipartite weighted matching","author":"Huang","year":"1990"},{"issue":"7","key":"10.1016\/0167-9260(91)90006-7_BIB13","doi-asserted-by":"crossref","first-page":"768","DOI":"10.1109\/43.31534","article-title":"Algorithms for hardware allocation in data path synthesis","volume":"8","author":"Devadas","year":"1989","journal-title":"IEEE Trans. on CAD"},{"key":"10.1016\/0167-9260(91)90006-7_BIB14","series-title":"3","article-title":"A novel scheduling\/allocation approach for datapath synthesis based on genetic paradigms","author":"Wehn","year":"1990"},{"key":"10.1016\/0167-9260(91)90006-7_BIB15","series-title":"European Design Automation Conference","first-page":"141","article-title":"Interconnection optimisation during data path allocation","author":"Stok","year":"1990"},{"key":"10.1016\/0167-9260(91)90006-7_BIB16","series-title":"27th ACM\/IEEE Design Automation Conference","first-page":"505","article-title":"A global dynamic register allocation and binding for a data path synthesis system","author":"Woo","year":"1990"},{"year":"1985","series-title":"VLSI and Modern Signal Processing","author":"Kung","key":"10.1016\/0167-9260(91)90006-7_BIB17"},{"key":"10.1016\/0167-9260(91)90006-7_BIB18","series-title":"27th ACM\/IEEE Design Automation Conference","first-page":"65","article-title":"Optimal and heuristic data path scheduling for high-level synthesis","author":"Huang","year":"1990"}],"container-title":["Integration"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167926091900067?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167926091900067?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T21:37:46Z","timestamp":1757453866000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167926091900067"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,3]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,3]]}},"alternative-id":["0167926091900067"],"URL":"https:\/\/doi.org\/10.1016\/0167-9260(91)90006-7","relation":{},"ISSN":["0167-9260"],"issn-type":[{"type":"print","value":"0167-9260"}],"subject":[],"published":{"date-parts":[[1991,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"FLORA: A data path allocator based on branch-and-bound search","name":"articletitle","label":"Article Title"},{"value":"Integration","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0167-9260(91)90006-7","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1991 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}