{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:23:34Z","timestamp":1750220614227,"version":"3.41.0"},"reference-count":27,"publisher":"The Scientific and Technological Research Council of Turkey (TUBITAK-ULAKBIM) - DIGITAL COMMONS JOURNALS","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Turk J Elec Eng & Comp Sci"],"published-print":{"date-parts":[[2017]]},"DOI":"10.3906\/elk-1411-129","type":"journal-article","created":{"date-parts":[[2017,4,11]],"date-time":"2017-04-11T06:48:20Z","timestamp":1491893300000},"page":"844-861","source":"Crossref","is-referenced-by-count":0,"title":["An optimized buffer insertion algorithm with delay-power constraints for VLSI layouts"],"prefix":"10.55730","volume":"25","author":[{"given":"Chessda","family":"UTTRAPHAN","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nasir","family":"SHAIKH-HUSIN","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed","family":"KHALIL-HANI","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"34691","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MPOT.2010.935825"},{"key":"ref2","doi-asserted-by":"crossref","unstructured":"van Ginneken LPPP. Buffer placement in distributed RC-tree networks for minimal Elmore delay. In: IEEE International Symposium on Circuit and System; 1--3 May 1990; New Orleans, LA, USA: IEEE. pp. 865-868.","DOI":"10.1109\/ISCAS.1990.112223"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.1983.1270037"},{"key":"ref4","unstructured":"Dasgupta S, Papadimitriou CH, Vazirani UV. Algorithms. New York, NY, USA: McGraw-Hill, 2006."},{"key":"ref5","doi-asserted-by":"crossref","unstructured":"Alpert CJ, Mehta DP, Sapatnekar SS. Handbook of algorithms for physical design automation. Boca Raton, FL, USA: Auerbach Publications, 2009.","DOI":"10.1201\/9781420013481"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ASIC.2001.954689"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2004.825841"},{"key":"ref8","doi-asserted-by":"crossref","unstructured":"Li R, Zhou D, Liu J, Zeng X. Power-optimal simultaneous buffer insertion\/sizing and wire sizing for two-pin nets. IEEE T Comput Aid D 2005; 24: 1915-1924.","DOI":"10.1109\/TCAD.2005.852672"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2010.2073790"},{"key":"ref10","doi-asserted-by":"crossref","unstructured":"Shi W, Li Z. An $O(n $log $n)$ time algorithm for optimal buffer insertion. In: IEEE Design Automation Conference; 2--6 June 2003: IEEE. pp. 580-585.","DOI":"10.1145\/775832.775980"},{"key":"ref11","doi-asserted-by":"crossref","unstructured":"Shi W, Li Z. A fast algorithm for optimal buffer insertion. IEEE T Comput Aid D 2005; 24: 879-891.","DOI":"10.1109\/TCAD.2005.847942"},{"key":"ref12","doi-asserted-by":"crossref","unstructured":"Li Z, Shi W. An $O$(\\textit{bn}$^{2})$ time algorithm for optimal buffer insertion with $b$ buffer types. IEEE T Comput Aid D 2006; 25: 484-489.","DOI":"10.1109\/TCAD.2005.854631"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2011.2174639"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/43.851998"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/337292.337502"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1629911.1630026"},{"key":"ref17","doi-asserted-by":"crossref","unstructured":"Khalil-Hani M, Shaikh-Husin N. An optimization algorithm based on grid-graphs for minimizing interconnect delay in VLSI layout design. Malayas J Comput Sci 2009; 22: 19-33.","DOI":"10.22452\/mjcs.vol22no1.2"},{"key":"ref18","doi-asserted-by":"crossref","unstructured":"Hu J, Alpert CJ, Quay ST, Gandham G. Buffer insertion with adaptive blockage avoidance. IEEE T Comput Aid D 2003; 22: 492-498.","DOI":"10.1109\/TCAD.2003.809647"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISQED.2014.6783348"},{"key":"ref20","doi-asserted-by":"crossref","unstructured":"Lai M, Wong DF. Maze routing with buffer insertion and wiresizing. IEEE T Comput Aid D 2002; 21: 1205-1209.","DOI":"10.1109\/TCAD.2002.802260"},{"key":"ref21","doi-asserted-by":"crossref","unstructured":"Lee CY. An algorithm for path connections and its applications. IEEE T Comput 1961; 10: 346-365.","DOI":"10.1109\/TEC.1961.5219222"},{"key":"ref22","unstructured":"Md-Yusof Z, Khalil-Hani M, Marsono MN, Shaikh-Husin N. Optimizing multi-constraint VLSI interconnect routing. In: International Symposium on Integrated Circuits; 14--16 December 2009; Singapore: IEEE. pp 655-658."},{"key":"ref23","doi-asserted-by":"crossref","unstructured":"van Mieghem P, Kuipers F. Concepts of exact QoS routing algorithms. IEEE Acm T Network 2004; 12: 851-864.","DOI":"10.1109\/TNET.2004.836112"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2006.890096"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/43.559334"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/SCOReD.2013.7002621"},{"key":"ref27","unstructured":"Cormen TH, Leiserson CE, Rivest RL. Introduction to Algorithms. 3rd ed. Boston, MA, USA: McGraw-Hill, 2009. \\end{reference} \\end{document}"}],"container-title":["TURKISH JOURNAL OF ELECTRICAL ENGINEERING & COMPUTER SCIENCES"],"original-title":[],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:47:51Z","timestamp":1750196871000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.tubitak.gov.tr\/elektrik\/vol25\/iss2\/16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":27,"URL":"https:\/\/doi.org\/10.3906\/elk-1411-129","relation":{},"ISSN":["1300-0632","1303-6203"],"issn-type":[{"type":"print","value":"1300-0632"},{"type":"electronic","value":"1303-6203"}],"subject":[],"published":{"date-parts":[[2017]]}}}