{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:30:19Z","timestamp":1760711419914,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":7,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,23]],"date-time":"2024-06-23T00:00:00Z","timestamp":1719100800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["2349143","2235276","2349144","2349582","2349141"],"award-info":[{"award-number":["2349143","2235276","2349144","2349582","2349141"]}],"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":[[2024,6,23]]},"DOI":"10.1145\/3649329.3655897","type":"proceedings-article","created":{"date-parts":[[2024,11,7]],"date-time":"2024-11-07T19:27:22Z","timestamp":1731007642000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Ink: Efficient Incremental k-Critical Path Generation"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-5455-037X","authenticated-orcid":false,"given":"Che","family":"Chang","sequence":"first","affiliation":[{"name":"University of Wisconsin, Madison, Madison, WI, United States"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9768-3378","authenticated-orcid":false,"given":"Tsung-Wei","family":"Huang","sequence":"additional","affiliation":[{"name":"University of Wisconsin at Madison, Madison, WI, United States"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3075-7437","authenticated-orcid":false,"given":"Dian-Lun","family":"Lin","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison, Madison, WI, United States"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7318-4010","authenticated-orcid":false,"given":"Guannan","family":"Guo","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Champaign, IL, United States"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6556-7038","authenticated-orcid":false,"given":"Shiju","family":"Lin","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong, China"}]}],"member":"320","published-online":{"date-parts":[[2024,11,7]]},"reference":[{"volume-title":"Static Timing Analysis for Nanometer Designs: A Practical Approach","author":"Bhasker Jayaram","key":"e_1_3_2_1_1_1","unstructured":"Jayaram Bhasker and Rakesh Chadha. 2009. Static Timing Analysis for Nanometer Designs: A Practical Approach. Springer."},{"key":"e_1_3_2_1_2_1","volume-title":"Wong","author":"Huang Tsung-Wei","year":"2021","unstructured":"Tsung-Wei Huang, Guannan Guo, Chun-Xun Lin, and Martin D. F. Wong. 2021. OpenTimer v2: A New Parallel Incremental Timing Analysis Engine. IEEE TCAD (2021)."},{"volume-title":"Cpp-Taskflow: Fast Task-based Parallel Programming using Modern C++","author":"Huang Tsung-Wei","key":"e_1_3_2_1_3_1","unstructured":"Tsung-Wei Huang, Chun-Xun Lin, Guannan Guo, and Martin Wong. 2019. Cpp-Taskflow: Fast Task-based Parallel Programming using Modern C++. In IEEE IPDPS. 974--983."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3104255"},{"key":"e_1_3_2_1_5_1","volume-title":"Wong","author":"Huang Tsung-Wei","year":"2015","unstructured":"Tsung-Wei Huang and Martin D. F. Wong. 2015. OpenTimer: A High-Performance Timing Analysis Tool. In IEEE\/ACM ICCAD. 895--902."},{"key":"e_1_3_2_1_6_1","volume-title":"Cheng-Ruei Li, Wei-Lun Chiu, and Yu-Ming Yang.","author":"Lee Pei-Yu","year":"2015","unstructured":"Pei-Yu Lee, Iris Hui-Ru Jiang, Cheng-Ruei Li, Wei-Lun Chiu, and Yu-Ming Yang. 2015. iTimerC 2.0: Fast incremental timing and CPPR analysis. In ACM\/IEEE ICCAD."},{"volume-title":"iitRACE: A memory efficient engine for fast incremental timing analysis and clock pessimism removal","author":"Peddawad Chaitanya","key":"e_1_3_2_1_7_1","unstructured":"Chaitanya Peddawad, Aman Goel, Dheeraj B, and Nitin Chandrachoodan. 2015. iitRACE: A memory efficient engine for fast incremental timing analysis and clock pessimism removal. In ACM\/IEEE ICCAD."}],"event":{"name":"DAC '24: 61st ACM\/IEEE Design Automation Conference","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE-CEDA","SIGBED ACM Special Interest Group on Embedded Systems"],"location":"San Francisco CA USA","acronym":"DAC '24"},"container-title":["Proceedings of the 61st ACM\/IEEE Design Automation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3649329.3655897","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3649329.3655897","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3649329.3655897","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:17:48Z","timestamp":1750295868000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3649329.3655897"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,23]]},"references-count":7,"alternative-id":["10.1145\/3649329.3655897","10.1145\/3649329"],"URL":"https:\/\/doi.org\/10.1145\/3649329.3655897","relation":{},"subject":[],"published":{"date-parts":[[2024,6,23]]},"assertion":[{"value":"2024-11-07","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}