{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,24]],"date-time":"2024-01-24T01:00:55Z","timestamp":1706058055824},"reference-count":18,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2012,3,1]],"date-time":"2012-03-01T00:00:00Z","timestamp":1330560000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."],"published-print":{"date-parts":[[2012,3]]},"DOI":"10.1109\/tcad.2011.2174639","type":"journal-article","created":{"date-parts":[[2012,2,22]],"date-time":"2012-02-22T20:16:04Z","timestamp":1329941764000},"page":"437-441","source":"Crossref","is-referenced-by-count":10,"title":["$O(mn)$ Time Algorithm for Optimal Buffer Insertion of Nets With $m$ Sinks"],"prefix":"10.1109","volume":"31","author":[{"given":"Zhuo","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ying","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weiping","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2006.890096"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1735023.1735048"},{"key":"ref12","first-page":"24","article-title":"Fast and flexible buffer trees that navigate the physical layout environment","author":"alpert","year":"2004","journal-title":"Proceedings 41st Design Automation Conference 2004 DAC"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1353629.1353633"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1735023.1735047"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2004.830932"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1155\/2011\/503025"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2011.2174639"},{"key":"ref18","year":"0","journal-title":"FBI Fast Buffer Insertion for Interconnect Optimization"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1109\/TCAD.2005.847942","article-title":"A fast algorithm for optimal buffer insertion","volume":"24","author":"shi","year":"2005","journal-title":"IEEE Trans Comput -Aided Des"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/4.494206"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1109\/TCAD.2005.854631","article-title":"An <formula formulatype=\"inline\"><tex Notation=\"TeX\">$O(bn^{2})$<\/tex><\/formula> time algorithm for optimal buffer insertion with <formula formulatype=\"inline\"><tex Notation=\"TeX\">$b$<\/tex><\/formula> buffer types","volume":"25","author":"li","year":"2006","journal-title":"IEEE Trans Comput -Aided Des"},{"key":"ref5","first-page":"216","article-title":"A flexible data structure for efficient buffer insertion","author":"chen","year":"2004","journal-title":"Proc IEEE Int Conf Comput Des"},{"key":"ref8","first-page":"609","article-title":"Complexity analysis and speedup techniques for optimal buffer insertion with minimum cost","author":"shi","year":"2004","journal-title":"Proc Conf Asia South Pacific Des Automat"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1353629.1353648"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.1990.112223"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2004.825841"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1629911.1630026"}],"container-title":["IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/43\/6152296\/06152778.pdf?arnumber=6152778","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:53:06Z","timestamp":1633909986000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6152778\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3]]},"references-count":18,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tcad.2011.2174639","relation":{},"ISSN":["0278-0070","1937-4151"],"issn-type":[{"value":"0278-0070","type":"print"},{"value":"1937-4151","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3]]}}}