{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T07:06:28Z","timestamp":1763535988476,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,10]],"date-time":"2022-07-10T00:00:00Z","timestamp":1657411200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"DARPA","award":["FA8650-18-2-7849"],"award-info":[{"award-number":["FA8650-18-2-7849"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,10]]},"DOI":"10.1145\/3489517.3530461","type":"proceedings-article","created":{"date-parts":[[2022,8,23]],"date-time":"2022-08-23T23:19:29Z","timestamp":1661296769000},"page":"421-426","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Improving LUT-based optimization for ASICs"],"prefix":"10.1145","author":[{"given":"Walter Lau","family":"Neto","sequence":"first","affiliation":[{"name":"University of Utah"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca","family":"Amar\u00fa","sequence":"additional","affiliation":[{"name":"Synopsys Inc."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vinicius","family":"Possani","sequence":"additional","affiliation":[{"name":"Synopsys Inc."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick","family":"Vuillod","sequence":"additional","affiliation":[{"name":"Synopsys Inc."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiong","family":"Luo","sequence":"additional","affiliation":[{"name":"Synopsys Inc."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan","family":"Mishchenko","sequence":"additional","affiliation":[{"name":"University of California"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre-Emmanuel","family":"Gaillardon","sequence":"additional","affiliation":[{"name":"University of Utah"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,8,23]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"LUT-based optimization for ASIC design flow,\" in 2021 DAC","author":"Amaru L.","year":"2021","unstructured":"L. Amaru, V. Possani, E. Testa, F. Marranghello, C. Casares, J. Luo, P. Vuillod, A. Mishchenko, and G. D. Micheli, \"LUT-based optimization for ASIC design flow,\" in 2021 DAC, 2021."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2006.887925"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2068716.2068720"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3268344"},{"issue":"6","key":"e_1_3_2_1_5_1","first-page":"675","article-title":"Timing-driven logic bi-decomposition","volume":"22","author":"Cortadella J.","year":"2003","unstructured":"J. Cortadella, \"Timing-driven logic bi-decomposition,\" IEEE TCAD, vol. 22, no. 6, pp. 675--685, 2003.","journal-title":"IEEE TCAD"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.273754"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/541643"},{"key":"e_1_3_2_1_8_1","first-page":"227","article-title":"Chortle-crf: Fast technology mapping for lookup table-based FPGAs","author":"Francis R.","year":"1991","unstructured":"R. Francis, J. Rose, and Z. Vranesic, \"Chortle-crf: Fast technology mapping for lookup table-based FPGAs,\" in DAC, pp. 227--233, 1991.","journal-title":"DAC"},{"key":"e_1_3_2_1_9_1","first-page":"197","article-title":"On solving covering problems","author":"Coudert O.","year":"1996","unstructured":"O. Coudert, \"On solving covering problems,\" in DAC, pp. 197--202, 1996.","journal-title":"DAC"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3316781.3317905"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"E. Testa L. Amar\u00fa M. Soeken A. Mishchenko P. Vuillod J. Luo C. Casares P.-E. Gaillardon and G. De Micheli \"Scalable Boolean methods in a modern synthesis flow \" in DATE pp. 1643--1648 2019.","DOI":"10.23919\/DATE.2019.8714776"},{"key":"e_1_3_2_1_12_1","volume-title":"Support-reducing decomposition for FPGA mapping,\" IEEE TCAD","author":"Machado L.","year":"2018","unstructured":"L. Machado and J. Cortadella, \"Support-reducing decomposition for FPGA mapping,\" IEEE TCAD, 2018."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"L. Amar\u00fa M. Soeken P. Vuillod J. Luo A. Mishchenko J. Olson R. Brayton and G. De Micheli \"Improvements to Boolean resynthesis \" in DATE pp. 755--760 2018.","DOI":"10.23919\/DATE.2018.8342108"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.795224"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/41.19078"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.52213"},{"key":"e_1_3_2_1_17_1","unstructured":"R. Brayton and C. McMullen \"The decomposition and factorization of boolean expressions \" in International Symposium on Circuits and Systems pp. 29--54 1982."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2006.882119"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/296399.296425"},{"key":"e_1_3_2_1_20_1","first-page":"765","volume-title":"Boolean decomposition using two-literal divisors,\" in Proceedings of the 17th VLSID, (USA)","author":"Modi N.","year":"2004","unstructured":"N. Modi and J. Cortadella, \"Boolean decomposition using two-literal divisors,\" in Proceedings of the 17th VLSID, (USA), p. 765, IEEE Computer Society, 2004."},{"key":"e_1_3_2_1_21_1","first-page":"38","volume-title":"Boolean factoring and decomposition of logic networks,\" in 2008 IEEE\/ACM ICCAD","author":"Mishchenko A.","year":"2008","unstructured":"A. Mishchenko, R. Brayton, and S. Chatterjee, \"Boolean factoring and decomposition of logic networks,\" in 2008 IEEE\/ACM ICCAD, pp. 38--44, 2008."},{"key":"e_1_3_2_1_22_1","unstructured":"L. Amar\u00fa P.-E. Gaillardon and G. De Micheli \"The EPFL combinational benchmark suite \" in International Workshop on Logic & Synthesis 2015."},{"key":"e_1_3_2_1_23_1","unstructured":"Link: https:\/\/tinyurl.com\/dac22-results."},{"key":"e_1_3_2_1_24_1","unstructured":"OpenCores: https:\/\/opencores.org."}],"event":{"name":"DAC '22: 59th ACM\/IEEE Design Automation Conference","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE CEDA"],"location":"San Francisco California","acronym":"DAC '22"},"container-title":["Proceedings of the 59th ACM\/IEEE Design Automation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3489517.3530461","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3489517.3530461","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3489517.3530461","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:39Z","timestamp":1750191519000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3489517.3530461"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,10]]},"references-count":24,"alternative-id":["10.1145\/3489517.3530461","10.1145\/3489517"],"URL":"https:\/\/doi.org\/10.1145\/3489517.3530461","relation":{},"subject":[],"published":{"date-parts":[[2022,7,10]]},"assertion":[{"value":"2022-08-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}