{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:05:22Z","timestamp":1730271922152,"version":"3.28.0"},"reference-count":11,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/iscas.2006.1692588","type":"proceedings-article","created":{"date-parts":[[2006,9,22]],"date-time":"2006-09-22T17:01:13Z","timestamp":1158944473000},"page":"325-328","source":"Crossref","is-referenced-by-count":0,"title":["Performance and Power Aware Buffered Tree Construction"],"prefix":"10.1109","author":[{"family":"Yibo Wang","sequence":"first","affiliation":[]},{"family":"Yici Cai","sequence":"additional","affiliation":[]},{"family":"Xianlong Hong","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"volume":"98 103","journal-title":"Buffer tree synthesis with consideration of temporal locality sink polarity requirements solution cost and blockages Proc Int Symp Physical Design","year":"2002","author":"hrkic","key":"3"},{"journal-title":"A simultaneous routing tree construction and fanout optimization algorithm IEEE\/ACM International Conference on Computer-Aided Design","first-page":"625","year":"1998","author":"salek","key":"2"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.1996.569710"},{"volume":"865 868","journal-title":"Buffer placement in distributed RC-tree networks for minimal Elmore delay Proc Int Symp on Circuits and Systems","year":"1990","author":"van ginneken","key":"1"},{"volume":"535 539","journal-title":"A graph based algorithm for optimal buffer insertion under accurate delay models Design Automation and Test in Europe","year":"2001","author":"gao","key":"7"},{"volume":"479 484","journal-title":"Buffer insertion with accurate gate and interconnect delay computation Proc ACM\/IEEE Design Automation Conf","year":"1999","author":"alpert","key":"6"},{"key":"5","article-title":"N.Chu","volume":"361 364","author":"dechu","year":"2004","journal-title":"An efficient routing tree construction algorithm with buffer insertion wire sizing and obstacle considerations ASP-DAC"},{"volume":"49 56","journal-title":"A new algorithm for routing tree construction with buffer insertion and wire sizing under obstacle constraints Proc Int Conf Computer-Aided Design","year":"2001","author":"tang","key":"4"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TED.2002.804706"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/5.920581"},{"year":"2003","key":"11"}],"event":{"name":"2006 IEEE International Symposium on Circuits and Systems","acronym":"ISCAS-06","location":"Island of Kos, Greece"},"container-title":["2006 IEEE International Symposium on Circuits and Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/11145\/35661\/01692588.pdf?arnumber=1692588","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,15]],"date-time":"2017-03-15T17:24:10Z","timestamp":1489598650000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1692588\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/iscas.2006.1692588","relation":{},"subject":[]}}