{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:32:14Z","timestamp":1757626334788,"version":"3.44.0"},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1989,11,1]],"date-time":"1989-11-01T00:00:00Z","timestamp":625881600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1989,11,1]],"date-time":"1989-11-01T00:00:00Z","timestamp":625881600000},"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":[[1989,11]]},"DOI":"10.1016\/0167-9260(89)90043-6","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T14:37:33Z","timestamp":1047652653000},"page":"99-109","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["Operators allocation in the silicon compiler SCOOP"],"prefix":"10.1016","volume":"8","author":[{"given":"B.","family":"Rouzeyre","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Ezzedine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Sagnes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-9260(89)90043-6_BIB1","series-title":"3rd Caltech Conf. VLSI","article-title":"CAPRI: A design methodology and a silicon compiler for VLSI specified by algorithms","author":"Anceau","year":"1983"},{"issue":"9","key":"10.1016\/0167-9260(89)90043-6_BIB2","doi-asserted-by":"crossref","DOI":"10.1145\/362342.362367","article-title":"Finding all cliques of an undirected graph","volume":"16","author":"Bron","year":"1977","journal-title":"Commun. ACM"},{"key":"10.1016\/0167-9260(89)90043-6_BIB3","article-title":"PLEX: Automatically generated computer layout","author":"Burick","year":"1983","journal-title":"IEEE Comput. Des."},{"key":"10.1016\/0167-9260(89)90043-6_BIB4","series-title":"Proc. European Solid State Circuit Conf.","article-title":"Evolution of CAD tools towards third generation custom VLSI design","author":"De Mann","year":"1985"},{"key":"10.1016\/0167-9260(89)90043-6_BIB5","series-title":"Proc. IASTED Int. Conf. Appl. Info.","article-title":"Graphe de controle et VLSI","author":"Ezzedine","year":"1987"},{"key":"10.1016\/0167-9260(89)90043-6_BIB6","series-title":"Proc. 20th Des. Auto. Conf.","article-title":"A method of automatic data path synthesis","author":"Hitchcock","year":"1980"},{"year":"1985","series-title":"APPOLON, a data path silicon compiler ICCD","author":"Jamier","key":"10.1016\/0167-9260(89)90043-6_BIB7"},{"key":"10.1016\/0167-9260(89)90043-6_BIB8","series-title":"Proc. 16th Des. Auto. Conf.","article-title":"Bristle blocks: A silicon compiler","author":"Johansen","year":"1979"},{"key":"10.1016\/0167-9260(89)90043-6_BIB9","article-title":"The VLSI design assistant: From algorithms to silicon","author":"Kowalski","year":"1983","journal-title":"IEEE Des. Test"},{"key":"10.1016\/0167-9260(89)90043-6_BIB10","series-title":"Proc. 22nd Des. Auto. Conf.","article-title":"The VLSI design automation assistant: What's in knowledge base","author":"Kowalski","year":"1982"},{"key":"10.1016\/0167-9260(89)90043-6_BIB11","series-title":"Proc. ISSSE '89 Conf.","article-title":"CAD for ASIC architecture","author":"Rouzeyre","year":"1989"},{"key":"10.1016\/0167-9260(89)90043-6_BIB12","doi-asserted-by":"crossref","DOI":"10.1109\/MC.1983.1654270","article-title":"An approach to silicon compilation","author":"Southard","year":"1983","journal-title":"IEEE Comput."},{"article-title":"Automated synthesis of data paths in digital systems","year":"1984","author":"Tseng","key":"10.1016\/0167-9260(89)90043-6_BIB13"},{"issue":"3","key":"10.1016\/0167-9260(89)90043-6_BIB14","doi-asserted-by":"crossref","DOI":"10.1137\/0206036","article-title":"A new algorithm for generating all the maximal independent sets","volume":"6","author":"Tsukiyama","year":"1977","journal-title":"SIAM J. Comput."}],"container-title":["Integration"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167926089900436?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167926089900436?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:36:54Z","timestamp":1757453814000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167926089900436"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,11]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,11]]}},"alternative-id":["0167926089900436"],"URL":"https:\/\/doi.org\/10.1016\/0167-9260(89)90043-6","relation":{},"ISSN":["0167-9260"],"issn-type":[{"type":"print","value":"0167-9260"}],"subject":[],"published":{"date-parts":[[1989,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Operators allocation in the silicon compiler SCOOP","name":"articletitle","label":"Article Title"},{"value":"Integration","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0167-9260(89)90043-6","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1989 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}