{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:36:29Z","timestamp":1750307789345,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":8,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,2,24]],"date-time":"2008-02-24T00:00:00Z","timestamp":1203811200000},"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":[[2008,2,24]]},"DOI":"10.1145\/1344671.1344679","type":"proceedings-article","created":{"date-parts":[[2008,2,28]],"date-time":"2008-02-28T14:02:49Z","timestamp":1204207369000},"page":"37-46","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Beyond the arithmetic constraint"],"prefix":"10.1145","author":[{"given":"Michael T.","family":"Frederick","sequence":"first","affiliation":[{"name":"Iowa State University, Ames, IA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arun K.","family":"Somani","sequence":"additional","affiliation":[{"name":"Iowa State University, Ames, IA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,2,24]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Altera. Stratix Series User Guides. www.altera.com.  Altera. Stratix Series User Guides. www.altera.com."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.273754"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.329262"},{"key":"e_1_3_2_1_4_1","volume-title":"Flows in Networks","author":"Ford L. R.","year":"1962","unstructured":"L. R. Ford and D. R. Fulkerson . Flows in Networks . Princeton Univ. Press , Princeton, NJ , 1962 . L. R. Ford and D. R. Fulkerson. Flows in Networks. Princeton Univ. Press, Princeton, NJ, 1962."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCD.2007.4601892"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FPT.2004.1393272"},{"key":"e_1_3_2_1_7_1","unstructured":"OpenCores. www.opencores.org.  OpenCores. www.opencores.org."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/4.121549"}],"event":{"name":"FPGA08: ACM\/SIGDA International Symposium on Field Programmable Gate Arrays","sponsor":["ACM Association for Computing Machinery","SIGDA ACM Special Interest Group on Design Automation"],"location":"Monterey California USA","acronym":"FPGA08"},"container-title":["Proceedings of the 16th international ACM\/SIGDA symposium on Field programmable gate arrays"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1344671.1344679","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1344671.1344679","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:56:16Z","timestamp":1750254976000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1344671.1344679"}},"subtitle":["depth-optimal mapping of logic chains in LUT-based FPGAs"],"short-title":[],"issued":{"date-parts":[[2008,2,24]]},"references-count":8,"alternative-id":["10.1145\/1344671.1344679","10.1145\/1344671"],"URL":"https:\/\/doi.org\/10.1145\/1344671.1344679","relation":{},"subject":[],"published":{"date-parts":[[2008,2,24]]},"assertion":[{"value":"2008-02-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}