{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:57:35Z","timestamp":1750309055550,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,3,14]],"date-time":"2010-03-14T00:00:00Z","timestamp":1268524800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,3,14]]},"DOI":"10.1145\/1735023.1735047","type":"proceedings-article","created":{"date-parts":[[2010,3,16]],"date-time":"2010-03-16T19:27:05Z","timestamp":1268767625000},"page":"75-82","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Ultra-fast interconnect driven cell cloning for minimizing critical path delay"],"prefix":"10.1145","author":[{"given":"Zhuo","family":"Li","sequence":"first","affiliation":[{"name":"IBM Austin Research Lab, Austin, TX, USA"}]},{"given":"David A.","family":"Papa","sequence":"additional","affiliation":[{"name":"University of Michigan, Ann Arbor, MI, USA"}]},{"given":"Charles J.","family":"Alpert","sequence":"additional","affiliation":[{"name":"IBM Austin Research Lab, Austin, TX, USA"}]},{"given":"Shiyan","family":"Hu","sequence":"additional","affiliation":[{"name":"Michigan Technological University, Houghton, MI, USA"}]},{"given":"Weiping","family":"Shi","sequence":"additional","affiliation":[{"name":"Texas A&M University, College Station, TX, USA"}]},{"given":"Cliff","family":"Sze","sequence":"additional","affiliation":[{"name":"IBM Austin Research Lab, Austin, TX, USA"}]},{"given":"Ying","family":"Zhou","sequence":"additional","affiliation":[{"name":"Texas A&M University, College Station, TX, USA"}]}],"member":"320","published-online":{"date-parts":[[2010,3,14]]},"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\/274535.274550"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.855889"},{"key":"e_1_3_2_1_4_1","first-page":"609","article-title":"Complexity analysis and speedup techniques for optimal buffer insertion with minimum cost","author":"Shi W.","year":"2004","unstructured":"W. Shi , Z. Li , and C. J. Alpert , \" Complexity analysis and speedup techniques for optimal buffer insertion with minimum cost ,\" in ASPDAC , 2004 , pp. 609 -- 614 . W. Shi, Z. Li, and C. J. Alpert, \"Complexity analysis and speedup techniques for optimal buffer insertion with minimum cost,\" in ASPDAC, 2004, pp. 609--614.","journal-title":"ASPDAC"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/4.65707"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1120725.1120733"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2006.890096"},{"key":"e_1_3_2_1_8_1","first-page":"644","article-title":"PROP: A recursive paradigm for area-efficient and performance oriented partitioning of large FPGA netlists","author":"Ku\u017enar R.","year":"1995","unstructured":"R. Ku\u017enar and F. Brglez , \" PROP: A recursive paradigm for area-efficient and performance oriented partitioning of large FPGA netlists ,\" in ICCAD , 1995 , pp. 644 -- 649 . R. Ku\u017enar and F. Brglez, \"PROP: A recursive paradigm for area-efficient and performance oriented partitioning of large FPGA netlists,\" in ICCAD, 1995, pp. 644--649.","journal-title":"ICCAD"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1353629.1353633"},{"key":"e_1_3_2_1_10_1","first-page":"432","article-title":"Optimal replication for min-cut partitioning","author":"Hwang J.","year":"1992","unstructured":"J. Hwang and A. El Gamal , \" Optimal replication for min-cut partitioning ,\" in ICCAD , 1992 , pp. 432 -- 435 . J. Hwang and A. El Gamal, \"Optimal replication for min-cut partitioning,\" in ICCAD, 1992, pp. 432--435.","journal-title":"ICCAD"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1046192.1046200"},{"key":"e_1_3_2_1_12_1","first-page":"452","article-title":"Algorithms for optimal introduction of redundant logic for timing and area optimization","author":"Lillis J.","year":"1996","unstructured":"J. Lillis , C. K. Cheng and T. Y. Lin , \" Algorithms for optimal introduction of redundant logic for timing and area optimization ,\" in ISCAS , 1996 , pp. 452 -- 455 . J. Lillis, C. K. Cheng and T. Y. Lin, \"Algorithms for optimal introduction of redundant logic for timing and area optimization,\" in ISCAS, 1996, pp. 452--455.","journal-title":"ISCAS"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1127908.1127959"},{"key":"e_1_3_2_1_14_1","first-page":"233","article-title":"Timing optimization of logic network using gate duplication","author":"Chen C.","year":"1999","unstructured":"C. Chen and C. Tsui , \" Timing optimization of logic network using gate duplication ,\" in ASPDAC , 1999 , pp. 233 -- 236 . C. Chen and C. Tsui, \"Timing optimization of logic network using gate duplication,\" in ASPDAC, 1999, pp. 233--236.","journal-title":"ASPDAC"},{"key":"e_1_3_2_1_15_1","first-page":"1367","article-title":"Layout-aware gate duplication and buffer insertion","author":"Baneres D.","year":"2007","unstructured":"D. Baneres , J. Cortadella and M. Kishinevsky , \" Layout-aware gate duplication and buffer insertion ,\" in DATE , 2007 , pp. 1367 -- 1372 . D. Baneres, J. Cortadella and M. Kishinevsky, \"Layout-aware gate duplication and buffer insertion,\" in DATE, 2007, pp. 1367--1372.","journal-title":"DATE"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.945312"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSL2003.820527"},{"key":"e_1_3_2_1_18_1","first-page":"204","article-title":"Pyramids: An Efficient Computational Geometry-based Approach for Timing--driven Placement","author":"Luo T.","year":"2008","unstructured":"T. Luo , \" Pyramids: An Efficient Computational Geometry-based Approach for Timing--driven Placement .\" in ICCAD , 2008 , pp. 204 -- 211 . T. Luo et al., \"Pyramids: An Efficient Computational Geometry-based Approach for Timing--driven Placement.\" in ICCAD, 2008, pp. 204--211.","journal-title":"ICCAD"},{"issue":"11","key":"e_1_3_2_1_19_1","first-page":"799","article-title":"Zero skew clock routing with minimum wirelength","volume":"39","author":"Chao T. H.","year":"1992","unstructured":"T. H. Chao , \" Zero skew clock routing with minimum wirelength ,\" IEEE. Trans. CAS , vol. 39 , no. 11 , pp. 799 -- 814 , 1992 . T. H. Chao et al., \"Zero skew clock routing with minimum wirelength,\" IEEE. Trans. CAS, vol. 39, no. 11, pp. 799--814, 1992.","journal-title":"IEEE. Trans. CAS"}],"event":{"name":"ISPD '10: International Symposium on Physical Design","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE CAS"],"location":"San Francisco California USA","acronym":"ISPD '10"},"container-title":["Proceedings of the 19th international symposium on Physical design"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1735023.1735047","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1735023.1735047","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:29:43Z","timestamp":1750285783000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1735023.1735047"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3,14]]},"references-count":19,"alternative-id":["10.1145\/1735023.1735047","10.1145\/1735023"],"URL":"https:\/\/doi.org\/10.1145\/1735023.1735047","relation":{},"subject":[],"published":{"date-parts":[[2010,3,14]]},"assertion":[{"value":"2010-03-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}