{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T10:50:05Z","timestamp":1730199005816,"version":"3.28.0"},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,1,17]],"date-time":"2022-01-17T00:00:00Z","timestamp":1642377600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,1,17]],"date-time":"2022-01-17T00:00:00Z","timestamp":1642377600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,1,17]]},"DOI":"10.1109\/asp-dac52403.2022.9712548","type":"proceedings-article","created":{"date-parts":[[2022,2,21]],"date-time":"2022-02-21T17:39:17Z","timestamp":1645465157000},"page":"403-409","source":"Crossref","is-referenced-by-count":0,"title":["Delay Optimization of Combinational Logic by AND-OR Path Restructuring"],"prefix":"10.1109","author":[{"given":"Ulrich","family":"Brenner","sequence":"first","affiliation":[{"name":"Research Institute for Discrete Mathematics, University of Bonn,Germany"}]},{"given":"Anna","family":"Silvanus","sequence":"additional","affiliation":[{"name":"Research Institute for Discrete Mathematics University of Bonn,Germany"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2009.5090777"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-015-0067-x"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"ref13","article-title":"Computational complexity of logic synthesis and optimization","author":"keutzer","year":"1989","journal-title":"IWLS"},{"key":"ref14","first-page":"105","article-title":"Asymptotic estimation of the addition time of a parallel adder","volume":"19","author":"khrapchenko","year":"1970","journal-title":"Systems Theory Research"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1973.5009159"},{"journal-title":"A device for quantizing grouping and coding amplitude modulated pulses","year":"1949","author":"kraft","key":"ref16"},{"key":"ref17","first-page":"734","article-title":"An algorithmic approach for generic parallel adders","author":"liu","year":"2003","journal-title":"ICCAD"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2011.6105357"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-011-0023-y"},{"key":"ref4","article-title":"Constructing depth-optimum circuits for adders and And-Or paths","author":"brenner","year":"2020","journal-title":"ArXiv e-prints"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3340321"},{"key":"ref6","first-page":"675","article-title":"Timing-driven logic bidecomposition","volume":"22","author":"cortadella","year":"2003","journal-title":"TCAD"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1982.1675982"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1976.1674574"},{"journal-title":"Aproximationsalgorithmen im Technology Mapping","year":"2017","author":"elbert","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1514932.1514942"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2017.8203799"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1134\/S1990478909010086"},{"key":"ref20","first-page":"92","article-title":"Optimizing non-monotonic interconnect using functional simuation and logic restructuring","author":"plaza","year":"2008","journal-title":"ISPD"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2014.2341926"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2005.06.006"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2228360.2228499"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1147\/rd.404.0407"},{"key":"ref26","first-page":"1233","article-title":"Generalized earliest-first fast addition algorithm","author":"yeh","year":"2003","journal-title":"Trans Comput"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2007.4397320"}],"event":{"name":"2022 27th Asia and South Pacific Design Automation Conference (ASP-DAC)","start":{"date-parts":[[2022,1,17]]},"location":"Taipei, Taiwan","end":{"date-parts":[[2022,1,20]]}},"container-title":["2022 27th Asia and South Pacific Design Automation Conference (ASP-DAC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9712466\/9712479\/09712548.pdf?arnumber=9712548","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,13]],"date-time":"2022-06-13T17:08:33Z","timestamp":1655140113000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9712548\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,17]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/asp-dac52403.2022.9712548","relation":{},"subject":[],"published":{"date-parts":[[2022,1,17]]}}}