{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:32:13Z","timestamp":1750307533047,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,5,10]],"date-time":"2009-05-10T00:00:00Z","timestamp":1241913600000},"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":[[2009,5,10]]},"DOI":"10.1145\/1531542.1531624","type":"proceedings-article","created":{"date-parts":[[2009,5,12]],"date-time":"2009-05-12T12:52:47Z","timestamp":1242132767000},"page":"363-368","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Timing-driven N-way decomposition"],"prefix":"10.1145","author":[{"given":"David","family":"Baneres","sequence":"first","affiliation":[{"name":"Universitat Oberta de Catalunya, Barcelona, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jordi","family":"Cortadella","sequence":"additional","affiliation":[{"name":"Universitat Polit\u00e8cnica de Catalunya, Barcelona, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mike","family":"Kishinevsky","sequence":"additional","affiliation":[{"name":"Strategic CAD Lab, Intel Corporation, Hillsboro, OR, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,5,10]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/951513.951594"},{"key":"e_1_3_2_1_2_1","first-page":"59","volume-title":"ACM\/IEEE Design Automation Conference","author":"Yamashita S.","year":"1998","unstructured":"S. Yamashita , H. Sawada , and A. Nagoya , \" New methods to find optimal non-disjoint bi-decompositions,\" in Proc . ACM\/IEEE Design Automation Conference , 1998 , pp. 59 -- 68 . S. Yamashita, H. Sawada, and A. Nagoya, \"New methods to find optimal non-disjoint bi-decompositions,\" in Proc. ACM\/IEEE Design Automation Conference, 1998, pp. 59--68."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/337292.337323"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/378239.378353"},{"key":"e_1_3_2_1_5_1","first-page":"161","volume-title":"Synthesis of multi-level circuits using exor-gates,\" in Proc. of Reed-Muller'95","author":"Steinback B.","year":"1995","unstructured":"B. Steinback and A. Wereszczynski , \" Synthesis of multi-level circuits using exor-gates,\" in Proc. of Reed-Muller'95 , 1995 , pp. 161 -- 168 . B. Steinback and A. Wereszczynski, \"Synthesis of multi-level circuits using exor-gates,\" in Proc. of Reed-Muller'95, 1995, pp. 161--168."},{"key":"e_1_3_2_1_6_1","first-page":"229","author":"Lian Y.-Y.","year":"1999","unstructured":"Y.-Y. Lian and Y.-L. Lin , \"Layout-based logic decomposition for timing optimization,\" in Proc. of Asia and South Pacific Design Automation Conference , 1999 , pp. 229 -- 232 . Y.-Y. Lian and Y.-L. Lin, \"Layout-based logic decomposition for timing optimization,\" in Proc. of Asia and South Pacific Design Automation Conference, 1999, pp. 229--232.","journal-title":"Proc. of Asia and South Pacific Design Automation Conference"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2003.811447"},{"key":"e_1_3_2_1_8_1","volume-title":"The Structure of Computers and Computation","author":"Kuck D.","year":"1978","unstructured":"D. Kuck , The Structure of Computers and Computation . John Wiley & amp; Sons, 1978 . D. Kuck, The Structure of Computers and Computation. John Wiley & Sons, 1978."},{"key":"e_1_3_2_1_9_1","unstructured":"D. Baneres J. Cortadella and M. Kishinevsky \"A recursive paradigm to solve  D. Baneres J. Cortadella and M. Kishinevsky \"A recursive paradigm to solve"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2008.165"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.1988.122511"},{"key":"e_1_3_2_1_12_1","volume-title":"UC Berkeley","author":"Rudell R.","year":"1989","unstructured":"R. Rudell , \"Logic synthesis for VLSI design,\" Ph. D. dissertation , UC Berkeley , Apr. 1989 . R. Rudell, \"Logic synthesis for VLSI design,\" Ph.D. dissertation, UC Berkeley, Apr. 1989."},{"key":"e_1_3_2_1_13_1","first-page":"79","volume-title":"Conference on Advanced Research in VLSI","author":"Touati H. J.","year":"1990","unstructured":"H. J. Touati , C. W. Moon , R. K. Brayton , and A. Wang , \" Performance-oriented technology mapping,\" in Proc. 6th M.I.T . Conference on Advanced Research in VLSI , Apr. 1990 , pp. 79 -- 97 . H. J. Touati, C. W. Moon, R. K. Brayton, and A. Wang, \"Performance-oriented technology mapping,\" in Proc. 6th M.I.T. Conference on Advanced Research in VLSI, Apr. 1990, pp. 79--97."},{"key":"e_1_3_2_1_14_1","first-page":"519","volume-title":"Int. Conf. Computer-Aided Design (ICCAD)","author":"Chatterjee S.","year":"2005","unstructured":"S. Chatterjee , A. Mishchenko , R. Brayton , X. Wang , and T. Kam , \" Reducing structural bias in technology mapping,\" Proc . Int. Conf. Computer-Aided Design (ICCAD) , pp. 519 -- 526 , 2005 . S. Chatterjee, A. Mishchenko, R. Brayton, X. Wang, and T. Kam, \"Reducing structural bias in technology mapping,\" Proc. Int. Conf. Computer-Aided Design (ICCAD), pp. 519--526, 2005."}],"event":{"name":"GLSVLSI '09: Great Lakes Symposium on VLSI 2009","sponsor":["ACM Association for Computing Machinery","SIGDA ACM Special Interest Group on Design Automation"],"location":"Boston Area MA USA","acronym":"GLSVLSI '09"},"container-title":["Proceedings of the 19th ACM Great Lakes symposium on VLSI"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1531542.1531624","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1531542.1531624","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:23:13Z","timestamp":1750249393000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1531542.1531624"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5,10]]},"references-count":14,"alternative-id":["10.1145\/1531542.1531624","10.1145\/1531542"],"URL":"https:\/\/doi.org\/10.1145\/1531542.1531624","relation":{},"subject":[],"published":{"date-parts":[[2009,5,10]]},"assertion":[{"value":"2009-05-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}