{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:28:15Z","timestamp":1763458095213,"version":"3.45.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,3,19]],"date-time":"2018-03-19T00:00:00Z","timestamp":1521417600000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1527562 and CCF-1065318"],"award-info":[{"award-number":["CCF-1527562 and CCF-1065318"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,3,19]]},"DOI":"10.1145\/3036669.3036671","type":"proceedings-article","created":{"date-parts":[[2017,3,15]],"date-time":"2017-03-15T10:18:09Z","timestamp":1489573089000},"page":"67-74","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Clock Tree Construction based on Arrival Time Constraints"],"prefix":"10.1145","author":[{"given":"Rickard","family":"Ewetz","sequence":"first","affiliation":[{"name":"University of Central Florida, Orlando, FL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheng-Kok","family":"Koh","sequence":"additional","affiliation":[{"name":"Purdue University, West Lafayette, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,3,19]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2003.159781"},{"key":"e_1_3_2_1_2_1","volume-title":"Maximum mean weight cycle in a digraph and minimizing cycle time of a logic chip. Discrete Applied Math., 123(1--3):103--127","author":"Albrecht C.","year":"2002","unstructured":"C. Albrecht, B. Korte, J. Schietke, and J. Vygen. Maximum mean weight cycle in a digraph and minimizing cycle time of a logic chip. Discrete Applied Math., 123(1--3):103--127, 2002."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2160916.2160945"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/EDTC.1996.494154"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/293625.293628"},{"key":"e_1_3_2_1_6_1","first-page":"472","volume-title":"ASP-DAC '14","author":"Ewetz R.","year":"2014","unstructured":"R. Ewetz, S. Janarthanan, and C.-K. Koh. Fast clock skew scheduling based on sparse-graph algorithms. ASP-DAC '14, pages 472--477, 2014."},{"key":"e_1_3_2_1_7_1","volume-title":"Benchmark circuits for clock scheduling and synthesis. https:\/\/purr.purdue.edu\/publications\/1759","author":"Ewetz R.","year":"2015","unstructured":"R. Ewetz, S. Janarthanan, and C.-K. Koh. Benchmark circuits for clock scheduling and synthesis. https:\/\/purr.purdue.edu\/publications\/1759, 2015."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2717764.2717773"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2016.7428039"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2872334.2872349"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.55696"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2003.159695"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.1991.185269"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2160916.2160943"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2560519.2560524"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1735023.1735058"},{"key":"e_1_3_2_1_17_1","first-page":"359","volume-title":"TODAES","author":"Tsao C.-W. A.","year":"2002","unstructured":"C.-W. A. Tsao and C.-K. Koh. UST\/DME: a clock tree router for general skew constraints. TODAES, pages 359--379, 2002."}],"event":{"name":"ISPD '17: International Symposium on Physical Design","sponsor":["SIGDA ACM Special Interest Group on Design Automation"],"location":"Portland Oregon USA","acronym":"ISPD '17"},"container-title":["Proceedings of the 2017 ACM on International Symposium on Physical Design"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3036669.3036671","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3036669.3036671","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3036669.3036671","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:17:05Z","timestamp":1763457425000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3036669.3036671"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,19]]},"references-count":17,"alternative-id":["10.1145\/3036669.3036671","10.1145\/3036669"],"URL":"https:\/\/doi.org\/10.1145\/3036669.3036671","relation":{},"subject":[],"published":{"date-parts":[[2017,3,19]]},"assertion":[{"value":"2017-03-19","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}