{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T08:47:41Z","timestamp":1774687661654,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,1,16]],"date-time":"2023-01-16T00:00:00Z","timestamp":1673827200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,1,16]]},"DOI":"10.1145\/3566097.3567900","type":"proceedings-article","created":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T18:40:49Z","timestamp":1675190449000},"page":"264-270","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["BufFormer"],"prefix":"10.1145","author":[{"given":"Rongjian","family":"Liang","sequence":"first","affiliation":[{"name":"NVIDIA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siddhartha","family":"Nath","sequence":"additional","affiliation":[{"name":"NVIDIA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anand","family":"Rajaram","sequence":"additional","affiliation":[{"name":"NVIDIA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiang","family":"Hu","sequence":"additional","affiliation":[{"name":"Texas A&M University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haoxing","family":"Ren","sequence":"additional","affiliation":[{"name":"NVIDIA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,1,31]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proc. WOSET.","author":"Agiza A.","unstructured":"A. Agiza and S. Reda. 2020. Openphysyn: An open-source physical synthesis optimization toolkit. In Proc. WOSET."},{"key":"e_1_3_2_1_2_1","first-page":"70","article-title":"FLUTE: Fast lookup table based rectilinear Steiner minimal tree algorithm for VLSI design","volume":"27","author":"Chu C.","year":"2007","unstructured":"C. Chu and Y-C. Wong. 2007. FLUTE: Fast lookup table based rectilinear Steiner minimal tree algorithm for VLSI design. TCAD 27, 1 (2007), 70--83.","journal-title":"TCAD"},{"key":"e_1_3_2_1_3_1","volume-title":"Proc. DAC. 379--384","author":"Cong J.","unstructured":"J. Cong and X. Yuan. 2000. Routing tree construction under fixed buffer locations. In Proc. DAC. 379--384."},{"key":"e_1_3_2_1_4_1","unstructured":"D. Dueck. 2009. Affinity propagation: clustering data by passing messages. Citeseer."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00357-014-9161-z"},{"key":"e_1_3_2_1_6_1","unstructured":"O. Sener and V. Koltun. 2018. Multi-task learning as multi-objective optimization. NeurIPS 31 (2018)."},{"key":"e_1_3_2_1_7_1","first-page":"1672","article-title":"Autonomous application of netlist transformations inside lagrangian relaxation-based optimization","volume":"40","author":"Stefanidis A.","year":"2020","unstructured":"A. Stefanidis et al. 2020. Autonomous application of netlist transformations inside lagrangian relaxation-based optimization. TCAD 40, 8 (2020), 1672--1686.","journal-title":"TCAD"},{"key":"e_1_3_2_1_8_1","unstructured":"A. Vaswani et al. 2017. Attention is all you need. NeurIPS 30 (2017)."},{"key":"e_1_3_2_1_9_1","volume-title":"Proc. DAC. 588--593","author":"Alpert C. J.","year":"1997","unstructured":"C. J. Alpert et al. 1997. Wire segmenting for improved buffer insertion. In Proc. DAC. 588--593."},{"key":"e_1_3_2_1_10_1","first-page":"556","article-title":"Steiner tree optimization for buffers, blockages, and bays","volume":"20","author":"Alpert C. J.","year":"2001","unstructured":"C. J. Alpert et al. 2001. Steiner tree optimization for buffers, blockages, and bays. TCAD 20, 4 (2001), 556--562.","journal-title":"TCAD"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.855889"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"C. J. Alpert et al. 2008. Handbook of algorithms for physical design automation. CRC press.","DOI":"10.1201\/9781420013481"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3177540.3178239"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3068335"},{"key":"e_1_3_2_1_15_1","volume-title":"Proc. ISCAS. 865--868","author":"Van G.","year":"1990","unstructured":"G. Van et al. 1990. Buffer placement in distributed RC-tree networks for minimal Elmore delay. In Proc. ISCAS. 865--868."},{"key":"e_1_3_2_1_16_1","first-page":"437","article-title":"Optimal wire sizing and buffer insertion for low power and a generalized delay model","volume":"31","author":"Lillis J.","year":"1996","unstructured":"J. Lillis et al. 1996. Optimal wire sizing and buffer insertion for low power and a generalized delay model. JSSC 31, 3 (1996), 437--447.","journal-title":"JSSC"},{"key":"e_1_3_2_1_17_1","unstructured":"J. Yan et al. 2022. Towards Machine Learning for Placement and Routing in Chip Design: a Methodological Overview. arXiv preprint arXiv:2202.13564 (2022)."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TED.2003.820651"},{"key":"e_1_3_2_1_19_1","first-page":"451","article-title":"Repeater scaling and its impact on CAD","volume":"23","author":"Saxena P.","year":"2004","unstructured":"P. Saxena et al. 2004. Repeater scaling and its impact on CAD. TCAD 23, 4 (2004), 451--463.","journal-title":"TCAD"},{"key":"e_1_3_2_1_20_1","volume-title":"Proc. ICCAD. 322--326","author":"Chen R.","year":"2005","unstructured":"R. Chen et al. 2005. Efficient algorithms for buffer insertion in general circuits based on network flow. In Proc. ICCAD. 322--326."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629911.1630026"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3489517.3530645"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.324"},{"key":"e_1_3_2_1_24_1","volume-title":"Proc. ASP-DAC. 609--614","author":"Shi W.","year":"2004","unstructured":"W. Shi et al. 2004. Complexity analysis and speedup techniques for optimal buffer insertion with minimum cost. In Proc. ASP-DAC. 609--614."},{"key":"e_1_3_2_1_25_1","first-page":"1","article-title":"Self-supervised learning: Generative or contrastive","volume":"01","author":"Liu X.","year":"2021","unstructured":"X. Liu et al. 2021. Self-supervised learning: Generative or contrastive. TKDE 01 (2021), 1--1.","journal-title":"TKDE"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1391469.1391652"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1120725.1120733"}],"event":{"name":"ASPDAC '23: 28th Asia and South Pacific Design Automation Conference","location":"Tokyo Japan","acronym":"ASPDAC '23","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE CEDA","IEICE","IEEE CAS","IPSJ"]},"container-title":["Proceedings of the 28th Asia and South Pacific Design Automation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3566097.3567900","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3566097.3567900","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,7]],"date-time":"2026-01-07T17:33:19Z","timestamp":1767807199000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3566097.3567900"}},"subtitle":["A Generative ML Framework for Scalable Buffering"],"short-title":[],"issued":{"date-parts":[[2023,1,16]]},"references-count":27,"alternative-id":["10.1145\/3566097.3567900","10.1145\/3566097"],"URL":"https:\/\/doi.org\/10.1145\/3566097.3567900","relation":{},"subject":[],"published":{"date-parts":[[2023,1,16]]},"assertion":[{"value":"2023-01-31","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}