{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T08:09:10Z","timestamp":1771488550599,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,5,2]],"date-time":"2011-05-02T00:00:00Z","timestamp":1304294400000},"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":[[2011,5,2]]},"DOI":"10.1145\/1973009.1973049","type":"proceedings-article","created":{"date-parts":[[2011,5,3]],"date-time":"2011-05-03T12:48:54Z","timestamp":1304426934000},"page":"199-204","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Obstacle-avoiding and slew-constrained buffered clock tree synthesis for skew optimization"],"prefix":"10.1145","author":[{"given":"Feifei","family":"Niu","sequence":"first","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"given":"Qiang","family":"Zhou","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"given":"Hailong","family":"Yao","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"given":"Yici","family":"Cai","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"given":"Jianlei","family":"Yang","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"given":"C. N.","family":"Sze","sequence":"additional","affiliation":[{"name":"IBM Austin Research Laboratory, Austin, TX, USA"}]}],"member":"320","published-online":{"date-parts":[[2011,5,2]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"865","volume-title":"Proceedings of the IEEEInternational Symposium on Circuits and Systems","author":"P.","year":"1990","unstructured":"L.P.P. P. van Ginneken, Buffer placement in distributed RC-tree net-works for minimal Elmore delay , In Proceedings of the IEEEInternational Symposium on Circuits and Systems , pp. 865 -- 868 , 1990 . L.P.P.P. van Ginneken, Buffer placement in distributed RC-tree net-works for minimal Elmore delay, In Proceedings of the IEEEInternational Symposium on Circuits and Systems, pp. 865--868, 1990."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/4.494206"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1837274.1837296"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.602470"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2004.825875"},{"key":"e_1_3_2_1_6_1","first-page":"1468","volume-title":"Proc. DATE","author":"Lee Dongjin","year":"2010","unstructured":"Dongjin Lee , I. L. Markov , CONTANGO : Integrated optimization of SoCclock network , In Proc. DATE , pp. 1468 -- 1473 , 2010 Dongjin Lee, I. L. Markov, CONTANGO: Integrated optimization of SoCclock network, In Proc. DATE, pp. 1468--1473, 2010"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1837274.1837297"},{"key":"e_1_3_2_1_8_1","first-page":"389","volume-title":"Proc. ASPDAC","author":"Liu W.-H.","year":"2010","unstructured":"W.-H. Liu , Y.-L. Li , H.- C. Chen, Minimizing clock latency range inrobust clock tree synthesis , In Proc. ASPDAC , pp. 389 -- 394 , 2010 W.-H. Liu, Y.-L. Li, H.-C. Chen, Minimizing clock latency range inrobust clock tree synthesis, In Proc. ASPDAC, pp.389--394,2010"},{"key":"e_1_3_2_1_9_1","first-page":"395","volume-title":"Proc. ASPDAC","author":"Shih X.-W.","year":"2009","unstructured":"X.-W. Shih , C.-C. Cheng , Y.-K. Ho , and Y.-W. Chang ,Blockage-avoiding buffered clock-tree synthesis for clock latency range and skew minimization , In Proc. ASPDAC , pp. 395 -- 400 , 2009 X.-W. Shih, C.-C. Cheng, Y.-K. Ho, and Y.-W. Chang,Blockage-avoiding buffered clock-tree synthesis for clock latency range and skew minimization, In Proc. ASPDAC, pp. 395--400,2009"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/82.204128"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2007.906477"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.847942"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2005.63"},{"key":"e_1_3_2_1_14_1","first-page":"609","volume-title":"Proc. ASPDAC","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 Proc. ASPDAC , pp. 609 -- 614 , 2004 . W. Shi, Z. Li, and C. J. Alpert, Complexity analysis and speedup-techniques for optimal buffer insertion with minimum cost, In Proc. ASPDAC, pp. 609--614, 2004."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1118299.1118379"}],"event":{"name":"GLSVLSI '11: Great Lakes Symposium on VLSI 2011","location":"Lausanne Switzerland","acronym":"GLSVLSI '11","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE CEDA","IEEE CASS"]},"container-title":["Proceedings of the 21st edition of the great lakes symposium on Great lakes symposium on VLSI"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1973009.1973049","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1973009.1973049","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:52:23Z","timestamp":1750243943000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1973009.1973049"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5,2]]},"references-count":15,"alternative-id":["10.1145\/1973009.1973049","10.1145\/1973009"],"URL":"https:\/\/doi.org\/10.1145\/1973009.1973049","relation":{},"subject":[],"published":{"date-parts":[[2011,5,2]]},"assertion":[{"value":"2011-05-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}