{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:46:35Z","timestamp":1759333595333,"version":"3.28.0"},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,11]]},"DOI":"10.1109\/iccad.2014.7001413","type":"proceedings-article","created":{"date-parts":[[2015,1,13]],"date-time":"2015-01-13T15:11:15Z","timestamp":1421161875000},"page":"596-599","source":"Crossref","is-referenced-by-count":14,"title":["Fast path-based timing analysis for CPPR"],"prefix":"10.1109","author":[{"given":"Tsung-Wei","family":"Huang","sequence":"first","affiliation":[]},{"given":"Pei-Ci","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Martin D. F.","family":"Wong","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1109\/SFCS.1994.365697"},{"year":"1997","author":"hathaway","journal-title":"Network timing analysis method which eliminates timing variations between signals traversing a common circuit path","key":"ref11"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1145\/2560519.2565876"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1109\/ICCAD.2014.7001436"},{"key":"ref14","article-title":"Sign Off Quality Hierarchical Timing Constraints: Wishful Thinking or Reality?","author":"levitsky","year":"2014","journal-title":"TAU Workshop"},{"key":"ref15","article-title":"A New Implementation of Yen's Ranking Loopless Paths Algorithm","volume":"1","author":"martins","year":"2003","journal-title":"Journal of Operations Research Quarterly"},{"key":"ref16","article-title":"EDA Vendors should Improve the Runtime Performance of Path-Based Timing Analysis","author":"molina","year":"2013","journal-title":"Electronic Design"},{"year":"2011","author":"ravi","journal-title":"Common Clock Path Pessimism Analysis for Circuit Designs using Clock Tree Networks","key":"ref17"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1287\/mnsc.17.11.712"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1109\/ICCAD.2002.1167599"},{"year":"0","key":"ref4"},{"year":"0","journal-title":"TAU 2014 Contest Pessimism Removal of Timing Analysis","key":"ref3"},{"key":"ref6","first-page":"88","article-title":"The LCA problem revisited","volume":"1776","author":"bender","year":"2000","journal-title":"Proceedings of the 4th Latin American Symposium on Theoretical Informatics"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1016\/j.artint.2011.07.003"},{"year":"2013","author":"bhardwaj","journal-title":"Clock-reconvergence pessimism removal in hierarchical static timing analysis","key":"ref8"},{"year":"2009","author":"bhasker","journal-title":"Static Timing Analysis for Nanometer Designs A Practical Approach","key":"ref7"},{"year":"0","key":"ref2"},{"year":"0","key":"ref1"},{"year":"2009","author":"cristian","journal-title":"Efficient exhaustive path-based static timing analysis using a fast estimation technique","key":"ref9"}],"event":{"name":"2014 IEEE\/ACM International Conference on Computer-Aided Design (ICCAD)","start":{"date-parts":[[2014,11,2]]},"location":"San Jose, CA, USA","end":{"date-parts":[[2014,11,6]]}},"container-title":["2014 IEEE\/ACM International Conference on Computer-Aided Design (ICCAD)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6991350\/7001313\/07001413.pdf?arnumber=7001413","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,24]],"date-time":"2017-03-24T02:33:33Z","timestamp":1490322813000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7001413\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/iccad.2014.7001413","relation":{},"subject":[],"published":{"date-parts":[[2014,11]]}}}