{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T09:23:11Z","timestamp":1773134591170,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,23]],"date-time":"2024-06-23T00:00:00Z","timestamp":1719100800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["Nos. 62172322"],"award-info":[{"award-number":["Nos. 62172322"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62272359 and 62192734"],"award-info":[{"award-number":["62272359 and 62192734"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["YJSJ24015"],"award-info":[{"award-number":["YJSJ24015"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Innovation Fund of Xidian University","award":["YJSJ24015"],"award-info":[{"award-number":["YJSJ24015"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,23]]},"DOI":"10.1145\/3649329.3655678","type":"proceedings-article","created":{"date-parts":[[2024,11,7]],"date-time":"2024-11-07T19:27:22Z","timestamp":1731007642000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["DACPara: A Divide-and-Conquer Parallel Approach for High-Quality Logic Rewriting in Large-Scale Circuits"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0972-3999","authenticated-orcid":false,"given":"Nanjiang","family":"Qu","sequence":"first","affiliation":[{"name":"Xidian University, Xi' an, Shaanxi, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5429-4580","authenticated-orcid":false,"given":"Cong","family":"Tian","sequence":"additional","affiliation":[{"name":"Xidian University, Xi' an, Shaanxi, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3119-3242","authenticated-orcid":false,"given":"Zhenhua","family":"Duan","sequence":"additional","affiliation":[{"name":"Xidian University, Xi' an, Shaanxi, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,11,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.52213"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146909.1147048"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2017.2772854"},{"key":"e_1_3_2_1_4_1","first-page":"1","volume-title":"Giovanni De Micheli. Majority-Inverter Graph: A Novel Data-Structure and Algorithms for Efficient Logic Optimization. In Proceedings of the 51st Annual Design Automation Conference","author":"Amar\u00fa Luca","year":"2014","unstructured":"Luca Amar\u00fa, Pierre-Emmanuel Gaillardon, and Giovanni De Micheli. Majority-Inverter Graph: A Novel Data-Structure and Algorithms for Efficient Logic Optimization. In Proceedings of the 51st Annual Design Automation Conference, pages 1--6. ACM, 2014."},{"key":"e_1_3_2_1_5_1","first-page":"1030","volume-title":"Automation & Test in Europe Conference & Exhibition (DATE)","author":"Soeken Mathias","year":"2016","unstructured":"Mathias Soeken, Luca Gaetano Amar\u00f9, Pierre-Emmanuel Gaillardon, and Giovanni De Micheli. Optimizing Majority-Inverter Graphs With Functional Hashing. In 2016 Design, Automation & Test in Europe Conference & Exhibition (DATE), pages 1030--1035. IEEE, 2016."},{"key":"e_1_3_2_1_6_1","first-page":"151","volume-title":"Giovanni De Micheli. A Novel Basis for Logic Rewriting. In 2017 22nd Asia and South Pacific Design Automation Conference (ASP-DAC)","author":"Haaswijk Winston","year":"2017","unstructured":"Winston Haaswijk, Mathias Soeken, Luca Amar\u00fa, Pierre-Emmanuel Gaillardon, and Giovanni De Micheli. A Novel Basis for Logic Rewriting. In 2017 22nd Asia and South Pacific Design Automation Conference (ASP-DAC), pages 151--156. IEEE, 2017."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14295-6_5"},{"key":"e_1_3_2_1_8_1","first-page":"1","volume-title":"Andre Reis. Unlocking Fine-Grain Parallelism for AIG Rewriting. In 2018 IEEE\/ACM International Conference on Computer-Aided Design (ICCAD)","author":"Possani Vinicius","year":"2018","unstructured":"Vinicius Possani, Yi-Shan Lu, Alan Mishchenko, Keshav Pingali, Renato Ribas, and Andre Reis. Unlocking Fine-Grain Parallelism for AIG Rewriting. In 2018 IEEE\/ACM International Conference on Computer-Aided Design (ICCAD), pages 1--8. IEEE, 2018."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2023.3251741"},{"key":"e_1_3_2_1_10_1","first-page":"15","volume-title":"Proc. IWLS","volume":"6","author":"Mishchenko Alan","year":"2006","unstructured":"Alan Mishchenko and Robert Brayton. Scalable Logic Synthesis using a Simple Circuit Structure. In Proc. IWLS, volume 6, pages 15--22, 2006."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993501"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2019.2897704"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3316781.3317905"},{"key":"e_1_3_2_1_14_1","first-page":"1","volume-title":"Mustafa Elnainay. TACUE: A Timing-Aware Cuts Enumeration Algorithm for Parallel Synthesis. In Proceedings of the 51st Annual Design Automation Conference","author":"Elbayoumi Mahmoud","year":"2014","unstructured":"Mahmoud Elbayoumi, Mihir Choudhury, Victor Kravets, Andrew Sullivan, Michael Hsiao, and Mustafa Elnainay. TACUE: A Timing-Aware Cuts Enumeration Algorithm for Parallel Synthesis. In Proceedings of the 51st Annual Design Automation Conference, pages 1--6. ACM, 2014."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3020078.3021735"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3489517.3530462"},{"key":"e_1_3_2_1_17_1","volume-title":"Giovanni De Micheli. The EPFL Combinational Benchmark Suite. In Proceedings of the 24th International Workshop on Logic & Synthesis (IWLS)","author":"Amar\u00fa Luca","year":"2015","unstructured":"Luca Amar\u00fa, Pierre-Emmanuel Gaillardon, and Giovanni De Micheli. The EPFL Combinational Benchmark Suite. In Proceedings of the 24th International Workshop on Logic & Synthesis (IWLS), 2015."}],"event":{"name":"DAC '24: 61st ACM\/IEEE Design Automation Conference","location":"San Francisco CA USA","acronym":"DAC '24","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE-CEDA","SIGBED ACM Special Interest Group on Embedded Systems"]},"container-title":["Proceedings of the 61st ACM\/IEEE Design Automation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3649329.3655678","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3649329.3655678","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:17:48Z","timestamp":1750295868000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3649329.3655678"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,23]]},"references-count":17,"alternative-id":["10.1145\/3649329.3655678","10.1145\/3649329"],"URL":"https:\/\/doi.org\/10.1145\/3649329.3655678","relation":{},"subject":[],"published":{"date-parts":[[2024,6,23]]},"assertion":[{"value":"2024-11-07","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}