{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T06:02:31Z","timestamp":1725775351920},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2007,2,18]]},"DOI":"10.1145\/1216919.1216923","type":"proceedings-article","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T15:41:00Z","timestamp":1175787660000},"page":"23-32","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Designing efficient input interconnect blocks for LUT clusters using counting and entropy"],"prefix":"10.1145","author":[{"given":"Wenyi","family":"Feng","sequence":"first","affiliation":[{"name":"Actel Corporation, Mountain View, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sinan","family":"Kaptanoglu","sequence":"additional","affiliation":[{"name":"Actel Corporation, Mountain View, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,2,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2004.824300"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/553523"},{"key":"e_1_3_2_1_3_1","unstructured":"R. A. Brualdi. Introductory Combinatorics. Prentice Hall 1998.  R. A. Brualdi. Introductory Combinatorics. Prentice Hall 1998."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/225871.225886"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","DOI":"10.1002\/0471200611","volume-title":"Elements of Information Theory","author":"Cover T.","year":"1991","unstructured":"T. Cover , J. Thomas . Elements of Information Theory , Wiley & amp; Sons, 1991 . T. Cover, J. Thomas. Elements of Information Theory, Wiley & Sons, 1991."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/228370.228381"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1117278.1117289"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/368640.368816"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/FPT.2004.1393249"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/994706"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/611817.611821"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1950.tb02349.x"},{"key":"e_1_3_2_1_13_1","unstructured":"Xilinx Corp. http:\/\/www.xilinx.com.  Xilinx Corp. http:\/\/www.xilinx.com."}],"event":{"name":"FPGA07: ACM\/SIGDA International Symposium on Field Programmable Gate Arrays 2007","sponsor":["ACM Association for Computing Machinery","SIGDA ACM Special Interest Group on Design Automation"],"location":"Monterey California USA","acronym":"FPGA07"},"container-title":["Proceedings of the 2007 ACM\/SIGDA 15th international symposium on Field programmable gate arrays"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1216919.1216923","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,5]],"date-time":"2023-01-05T20:01:18Z","timestamp":1672948878000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1216919.1216923"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,2,18]]},"references-count":13,"alternative-id":["10.1145\/1216919.1216923","10.1145\/1216919"],"URL":"https:\/\/doi.org\/10.1145\/1216919.1216923","relation":{},"subject":[],"published":{"date-parts":[[2007,2,18]]},"assertion":[{"value":"2007-02-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}