{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,23]],"date-time":"2026-10-23T11:59:33Z","timestamp":1792756773183,"version":"4.5.0"},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2016,11,1]],"date-time":"2016-11-01T00:00:00Z","timestamp":1477958400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2016,11,1]],"date-time":"2016-11-01T00:00:00Z","timestamp":1477958400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2016,11,1]],"date-time":"2016-11-01T00:00:00Z","timestamp":1477958400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2016,11,1]],"date-time":"2016-11-01T00:00:00Z","timestamp":1477958400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1320585"],"award-info":[{"award-number":["CCF-1320585"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."],"published-print":{"date-parts":[[2016,11]]},"DOI":"10.1109\/tcad.2016.2524566","type":"journal-article","created":{"date-parts":[[2016,2,8]],"date-time":"2016-02-08T19:11:50Z","timestamp":1454958710000},"page":"1862-1875","source":"Crossref","is-referenced-by-count":31,"title":["UI-Timer 1.0: An Ultrafast Path-Based Timing Analysis Algorithm for CPPR"],"prefix":"10.1109","volume":"35","author":[{"given":"Tsung-Wei","family":"Huang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin D. F.","family":"Wong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","year":"2015","journal-title":"Incremental Timing Analysis and Incremental CPPR"},{"key":"ref11","first-page":"592","article-title":"Common path pessimism removal: An industry perspective","author":"garg","year":"2014","journal-title":"Proc IEEE\/ACM ICCAD"},{"key":"ref12","first-page":"372","article-title":"A fast parallel approach for common path pessimism removal","author":"tsai","year":"2015","journal-title":"Proc IEEE\/ACM ASPDAC"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2014.7001414"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2014.7001415"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/10719839_9"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2011.07.003"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365697"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-002-0010-2"},{"key":"ref19","first-page":"592","article-title":"An efficient algorithm for finding the k longest testable paths through each gate in a combinational circuit","author":"qiu","year":"2003","journal-title":"Proc IEEE ITC"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/SLIP.2015.7171710"},{"key":"ref4","author":"bhasker","year":"2009","journal-title":"Static Timing Analysis for Nanometer Designs A Practical Approach"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2717764.2717771"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2560519.2565876"},{"key":"ref6","year":"2014","journal-title":"TAU 2014 Contest Pessimism Removal of Timing Analysis"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2002.1167599"},{"key":"ref8","article-title":"Network timing analysis method which eliminates timing variations between signals traversing a common circuit path","author":"hathaway","year":"1997"},{"key":"ref7","article-title":"Clock-reconvergence pessimism removal in hierarchical static timing analysis","author":"bhardwaj","year":"2013"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2014.7001413"},{"key":"ref9","article-title":"Common clock path pessimism analysis for circuit designs using clock tree networks","author":"ravi","year":"2011"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2014.7001436"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.17.11.712"},{"key":"ref22","author":"cormen","year":"2009","journal-title":"Chapter 24 Single-Source Shortest Paths Introduction to Algorithm"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/6617.6621"},{"key":"ref24","year":"2015","journal-title":"OpenMPI Open Source High Performance Computing"},{"key":"ref23","year":"2015","journal-title":"OpenMP Parallel Programming API"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2015.7372666"},{"key":"ref25","year":"2015","journal-title":"Illinois Campus Cluster"}],"container-title":["IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/ielaam\/43\/7593407\/7400988-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/43\/7593407\/07400988.pdf?arnumber=7400988","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:47:45Z","timestamp":1649443665000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7400988\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11]]},"references-count":28,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tcad.2016.2524566","relation":{},"ISSN":["0278-0070","1937-4151"],"issn-type":[{"value":"0278-0070","type":"print"},{"value":"1937-4151","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,11]]}}}