{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,7]],"date-time":"2026-01-07T23:51:41Z","timestamp":1767829901859,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,6,8]],"date-time":"2008-06-08T00:00:00Z","timestamp":1212883200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000028","name":"Semiconductor Research Corporation","doi-asserted-by":"publisher","award":["2004-TJ-1205"],"award-info":[{"award-number":["2004-TJ-1205"]}],"id":[{"id":"10.13039\/100000028","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,6,8]]},"DOI":"10.1145\/1391469.1391652","type":"proceedings-article","created":{"date-parts":[[2008,7,30]],"date-time":"2008-07-30T12:09:58Z","timestamp":1217419798000},"page":"708-713","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Circuit-wise buffer insertion and gate sizing algorithm with scalability"],"prefix":"10.1145","author":[{"given":"Zhanyuan","family":"Jiang","sequence":"first","affiliation":[{"name":"Texas A&M University, College Station, Texas and Atoptech, Inc., Santa Clara, California"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weiping","family":"Shi","sequence":"additional","affiliation":[{"name":"Texas A&M University, College Station, Texas"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,6,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2004.825841"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/981066.981107"},{"key":"e_1_3_2_1_3_1","first-page":"865","article-title":"Buffer placement in distributed RC-tree networks for minimal Elmore delay","author":"van Ginneken L. P. P. P.","year":"1990","unstructured":"L. P. P. P. van Ginneken , \" Buffer placement in distributed RC-tree networks for minimal Elmore delay ,\" ISCAS , pp. 865 -- 868 , 1990 . L. P. P. P. van Ginneken, \"Buffer placement in distributed RC-tree networks for minimal Elmore delay,\" ISCAS, pp. 865--868, 1990.","journal-title":"ISCAS"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/4.494206"},{"key":"e_1_3_2_1_5_1","first-page":"210","article-title":"An efficient buffer insertion algorithm for large networks based on lagrangian relaxation","author":"Liu I.-M.","year":"1999","unstructured":"I.-M. Liu , A. Aziz , D. Wong , and H. Zhou , \" An efficient buffer insertion algorithm for large networks based on lagrangian relaxation ,\" ICCD , pp. 210 -- 215 , 1999 . I.-M. Liu, A. Aziz, D. Wong, and H. Zhou, \"An efficient buffer insertion algorithm for large networks based on lagrangian relaxation,\" ICCD, pp. 210--215, 1999.","journal-title":"ICCD"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065579.1065711"},{"key":"e_1_3_2_1_7_1","first-page":"322","article-title":"Efficient algorithms for buffer insertion in general circuits based on network flow","author":"Chen R.","year":"2005","unstructured":"R. Chen and H. Zhou , \" Efficient algorithms for buffer insertion in general circuits based on network flow ,\" ICCAD , pp. 322 -- 326 , 2005 . R. Chen and H. Zhou, \"Efficient algorithms for buffer insertion in general circuits based on network flow,\" ICCAD, pp. 322--326, 2005.","journal-title":"ICCAD"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146909.1146988"},{"key":"e_1_3_2_1_9_1","first-page":"326","article-title":"TILOS: A posynomial programming approach to transistor sizing","author":"Fishburn J. P.","year":"1985","unstructured":"J. P. Fishburn and A. E. Dunlop , \" TILOS: A posynomial programming approach to transistor sizing ,\" ICCAD , pp. 326 -- 328 , 1985 . J. P. Fishburn and A. E. Dunlop, \"TILOS: A posynomial programming approach to transistor sizing,\" ICCAD, pp. 326--328, 1985.","journal-title":"ICCAD"},{"key":"e_1_3_2_1_10_1","first-page":"1621","article-title":"An exact solution to the transistor sizing problem for CMOS circuits using convex optimizaiton","author":"Sapatnekar S. S.","year":"1993","unstructured":"S. S. Sapatnekar , V. B. Rae , P. M. Vaidya , and S. M. Kang , \" An exact solution to the transistor sizing problem for CMOS circuits using convex optimizaiton ,\" TCAD , pp. 1621 -- 1634 , 1993 . S. S. Sapatnekar, V. B. Rae, P. M. Vaidya, and S. M. Kang, \"An exact solution to the transistor sizing problem for CMOS circuits using convex optimizaiton,\" TCAD, pp. 1621--1634, 1993.","journal-title":"TCAD"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/288548.289097"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2004.1382667"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/505388.505414"},{"key":"e_1_3_2_1_14_1","volume-title":"Layout and parasitic information for iscas circuits,\" http:\/\/dropzone.tamu.edu\/.xiang\/iscas.html","author":"Lu X.","year":"2003","unstructured":"X. Lu and W. Shi , \" Layout and parasitic information for iscas circuits,\" http:\/\/dropzone.tamu.edu\/.xiang\/iscas.html , 2003 . X. Lu and W. Shi, \"Layout and parasitic information for iscas circuits,\" http:\/\/dropzone.tamu.edu\/.xiang\/iscas.html, 2003."}],"event":{"name":"DAC '08: The 45th Annual Design Automation Conference 2008","location":"Anaheim California","acronym":"DAC '08","sponsor":["The EDA Consortium","IEEE\/CASS\/CANDE\/CEDA","SIGDA ACM Special Interest Group on Design Automation"]},"container-title":["Proceedings of the 45th annual Design Automation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1391469.1391652","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1391469.1391652","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:47:13Z","timestamp":1750258033000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1391469.1391652"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,8]]},"references-count":14,"alternative-id":["10.1145\/1391469.1391652","10.1145\/1391469"],"URL":"https:\/\/doi.org\/10.1145\/1391469.1391652","relation":{},"subject":[],"published":{"date-parts":[[2008,6,8]]},"assertion":[{"value":"2008-06-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}