{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T09:47:41Z","timestamp":1773568061102,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T00:00:00Z","timestamp":1559433600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,2]]},"DOI":"10.1145\/3316781.3317905","type":"proceedings-article","created":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T18:07:13Z","timestamp":1558634833000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":26,"title":["Scalable Generic Logic Synthesis"],"prefix":"10.1145","author":[{"given":"Heinz","family":"Riener","sequence":"first","affiliation":[{"name":"EPFL, Lausanne, CH"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eleonora","family":"Testa","sequence":"additional","affiliation":[{"name":"EPFL, Lausanne, CH"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Winston","family":"Haaswijk","sequence":"additional","affiliation":[{"name":"EPFL, Lausanne, CH"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan","family":"Mishchenko","sequence":"additional","affiliation":[{"name":"University of California, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca","family":"Amar\u00f9","sequence":"additional","affiliation":[{"name":"Synopsys Inc., Sunnyvale, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giovanni","family":"De Micheli","sequence":"additional","affiliation":[{"name":"EPFL, Lausanne, CH"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mathias","family":"Soeken","sequence":"additional","affiliation":[{"name":"EPFL, Lausanne, CH"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,6,2]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"15","article-title":"Scalable logic synthesis using a simple circuit structure","author":"Mishchenko A.","year":"2006","unstructured":"A. Mishchenko and R. K. Brayton , \" Scalable logic synthesis using a simple circuit structure ,\" in Internal Workshop on Logic Synthesis , 2006 , pp. 15 -- 22 . A. Mishchenko and R. K. Brayton, \"Scalable logic synthesis using a simple circuit structure,\" in Internal Workshop on Logic Synthesis, 2006, pp. 15--22.","journal-title":"Internal Workshop on Logic Synthesis"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14295-6_5"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2002.804386"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2593069.2593158"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2015.2488484"},{"key":"e_1_3_2_1_6_1","first-page":"2","article-title":"The multiplicative complexity of 6-variable Boolean functions","volume":"2018","author":"Turan M. S.","year":"2018","unstructured":"\u00c7. \u00c7alik, M. S. Turan , and R. Peralta , \" The multiplicative complexity of 6-variable Boolean functions ,\" IACR Cryptology ePrint Archive , vol. 2018 , p. 2 , 2018 . {Online}. Available: http:\/\/eprint.iacr.org\/2018\/002 \u00c7. \u00c7alik, M. S. Turan, and R. Peralta, \"The multiplicative complexity of 6-variable Boolean functions,\" IACR Cryptology ePrint Archive, vol. 2018, p. 2, 2018. {Online}. Available: http:\/\/eprint.iacr.org\/2018\/002","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_1_7_1","first-page":"151","volume-title":"ASP-DAC 2017","author":"Haaswijk W.","year":"2017","unstructured":"W. Haaswijk , M. Soeken , L. G. Amar\u00f9 , P. Gaillardon , and G. D. Micheli , \" A novel basis for logic rewriting,\" in 22nd Asia and South Pacific Design Automation Conference , ASP-DAC 2017 , Chiba, Japan , January 16-19, 2017 , 2017, pp. 151 -- 156 . {Online}. Available: W. Haaswijk, M. Soeken, L. G. Amar\u00f9, P. Gaillardon, and G. D. Micheli, \"A novel basis for logic rewriting,\" in 22nd Asia and South Pacific Design Automation Conference, ASP-DAC 2017, Chiba, Japan, January 16-19, 2017, 2017, pp. 151--156. {Online}. Available:"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/275107.275118"},{"key":"e_1_3_2_1_9_1","first-page":"309","volume-title":"Automation Test in Europe Conference Exhibition (DATE)","author":"Soeken M.","year":"2018","unstructured":"M. Soeken , W. Haaswijk , E. Testa , A. Mishchenko , L. G. Amar\u00f9 , R. K. Brayton , and G. D. Micheli , \" Practical exact synthesis,\" in 2018 Design , Automation Test in Europe Conference Exhibition (DATE) , March 2018 , pp. 309 -- 314 . M. Soeken, W. Haaswijk, E. Testa, A. Mishchenko, L. G. Amar\u00f9, R. K. Brayton, and G. D. Micheli, \"Practical exact synthesis,\" in 2018 Design, Automation Test in Europe Conference Exhibition (DATE), March 2018, pp. 309--314."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3195970.3196111"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146909.1147048"},{"key":"e_1_3_2_1_12_1","first-page":"2019","article-title":"On-the-fly and DAG-aware: Rewriting Boolean networks with exact synthesis,\" in 2019 Design, Automation & Test in Europe, DATE 2019, Florence","volume":"25","author":"Riener H.","year":"2019","unstructured":"H. Riener , W. Haaswijk , A. Mishchenko , G. D. Micheli , and M. Soeken , \" On-the-fly and DAG-aware: Rewriting Boolean networks with exact synthesis,\" in 2019 Design, Automation & Test in Europe, DATE 2019, Florence , Italy, March 25-29 , 2019 , 2019 . H. Riener, W. Haaswijk, A. Mishchenko, G. D. Micheli, and M. Soeken, \"On-the-fly and DAG-aware: Rewriting Boolean networks with exact synthesis,\" in 2019 Design, Automation & Test in Europe, DATE 2019, Florence, Italy, March 25-29, 2019, 2019.","journal-title":"Italy, March"},{"key":"e_1_3_2_1_13_1","first-page":"375","volume-title":"ICCAD 2011","author":"Mishchenko A.","year":"2011","unstructured":"A. Mishchenko , R. K. Brayton , S. Jang , and V. N. Kravets , \" Delay optimization using SOP balancing,\" in 2011 IEEE\/ACM International Conference on Computer-Aided Design , ICCAD 2011 , San Jose, California, USA , November 7-10, 2011 , 2011, pp. 375 -- 382 . {Online}. Available: A. Mishchenko, R. K. Brayton, S. Jang, and V. N. Kravets, \"Delay optimization using SOP balancing,\" in 2011 IEEE\/ACM International Conference on Computer-Aided Design, ICCAD 2011, San Jose, California, USA, November 7-10, 2011, 2011, pp. 375--382. {Online}. Available:"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.137523"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1754405.1754411"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3232195.3232202"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.23919\/DATE.2018.8342108"},{"key":"e_1_3_2_1_18_1","first-page":"05121","article-title":"The EPFL logic synthesis libraries","volume":"1805","author":"Soeken M.","year":"2018","unstructured":"M. Soeken , H. Riener , W. Haaswijk , and G. D. Micheli , \" The EPFL logic synthesis libraries ,\" CoRR , vol. abs\/ 1805 . 05121 , 2018 . {Online}. Available: http:\/\/arxiv.org\/abs\/1805.05121 M. Soeken, H. Riener, W. Haaswijk, and G. D. Micheli, \"The EPFL logic synthesis libraries,\" CoRR, vol. abs\/1805.05121, 2018. {Online}. Available: http:\/\/arxiv.org\/abs\/1805.05121","journal-title":"CoRR"}],"event":{"name":"DAC '19: The 56th Annual Design Automation Conference 2019","location":"Las Vegas NV USA","acronym":"DAC '19","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE-CEDA","SIGBED ACM Special Interest Group on Embedded Systems"]},"container-title":["Proceedings of the 56th Annual Design Automation Conference 2019"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3316781.3317905","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3316781.3317905","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:53:53Z","timestamp":1750204433000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3316781.3317905"}},"subtitle":["One Approach to Rule Them All"],"short-title":[],"issued":{"date-parts":[[2019,6,2]]},"references-count":18,"alternative-id":["10.1145\/3316781.3317905","10.1145\/3316781"],"URL":"https:\/\/doi.org\/10.1145\/3316781.3317905","relation":{},"subject":[],"published":{"date-parts":[[2019,6,2]]},"assertion":[{"value":"2019-06-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}