{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:33:01Z","timestamp":1750307581221,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,2,21]],"date-time":"2010-02-21T00:00:00Z","timestamp":1266710400000},"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":[[2010,2,21]]},"DOI":"10.1145\/1723112.1723145","type":"proceedings-article","created":{"date-parts":[[2010,2,23]],"date-time":"2010-02-23T15:35:30Z","timestamp":1266939330000},"page":"185-188","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Building a faster boolean matcher using bloom filter"],"prefix":"10.1145","author":[{"given":"Chun","family":"Zhang","sequence":"first","affiliation":[{"name":"State Key Lab of ASIC and System, Fudan University, Shanghai, NS, China"}],"role":[{"role":"author","vocab":"crossref"}]},{"given":"Yu","family":"Hu","sequence":"additional","affiliation":[{"name":"Electrical and Computer Engineering Department, University of Alberta, Alberta, Canada"}],"role":[{"role":"author","vocab":"crossref"}]},{"given":"Lingli","family":"Wang","sequence":"additional","affiliation":[{"name":"State Key Lab of ASIC and System, Fudan University, Shanghai, China"}],"role":[{"role":"author","vocab":"crossref"}]},{"given":"Lei","family":"He","sequence":"additional","affiliation":[{"name":"Electrical Engineering Department, UCLA, USA, Los Angeles, USA"}],"role":[{"role":"author","vocab":"crossref"}]},{"given":"Jiarong","family":"Tong","sequence":"additional","affiliation":[{"name":"State Key Lab of ASIC and System, Fudan University, Shanghai, China"}],"role":[{"role":"author","vocab":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,2,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065579.1065693"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2007.891362"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1216919.1216944"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.945303"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/264995.264996"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065579.1065681"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146909.1147034"},{"key":"e_1_3_2_1_8_1","first-page":"38","article-title":"Boolean factoring and decomposition of logic networks","author":"Mishchenko A.","year":"2008","unstructured":"A. Mishchenko , R. K. Brayton , and S. Chatterjee , \" Boolean factoring and decomposition of logic networks ,\" ICCAD 2008 , pp. 38 -- 44 . A. Mishchenko, R. K. Brayton, and S. Chatterjee, \"Boolean factoring and decomposition of logic networks,\" ICCAD 2008, pp. 38--44.","journal-title":"ICCAD"},{"key":"e_1_3_2_1_9_1","first-page":"1079","article-title":"Building a Better Boolean Matcher and Symmetry Detector","author":"Chai D.","year":"2006","unstructured":"D. Chai and A. Kuehlmann , \" Building a Better Boolean Matcher and Symmetry Detector ,\" DATE , 2006 , pp. 1079 -- 1084 . D. Chai and A. Kuehlmann, \"Building a Better Boolean Matcher and Symmetry Detector,\" DATE, 2006, pp. 1079--1084.","journal-title":"DATE"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_1_11_1","first-page":"350","article-title":"Exploiting symmetry in SAT-based Boolean matching for heterogeneous FPGA technology mapping","author":"Hu Y.","year":"2007","unstructured":"Y. Hu , V. Shih , R. Majumdar , and L. He , \" Exploiting symmetry in SAT-based Boolean matching for heterogeneous FPGA technology mapping ,\" ICCAD 2007 , pp. 350 -- 353 . Y. Hu, V. Shih, R. Majumdar, and L. He, \"Exploiting symmetry in SAT-based Boolean matching for heterogeneous FPGA technology mapping,\" ICCAD 2007, pp. 350--353.","journal-title":"ICCAD"},{"key":"e_1_3_2_1_12_1","unstructured":"\"ABC: A system for sequential synthesis and verification \" in http:\/\/www.eecs.berkeley.edu\/~alanmi\/abc\/.  \"ABC: A system for sequential synthesis and verification \" in http:\/\/www.eecs.berkeley.edu\/~alanmi\/abc\/."},{"key":"e_1_3_2_1_13_1","unstructured":"\"IWLS 2005 Benchmarks\" in http:\/\/iwls.org\/iwls2005\/benchmarks.html.  \"IWLS 2005 Benchmarks\" in http:\/\/iwls.org\/iwls2005\/benchmarks.html."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1508128.1508151"},{"key":"e_1_3_2_1_15_1","unstructured":"Bloom filter http:\/\/en.wikipedia.org\/wiki\/Bloom_filter  Bloom filter http:\/\/en.wikipedia.org\/wiki\/Bloom_filter"},{"key":"e_1_3_2_1_16_1","unstructured":"http:\/\/code.google.com\/p\/bloom\/  http:\/\/code.google.com\/p\/bloom\/"},{"key":"e_1_3_2_1_17_1","unstructured":"http:\/\/burtleburtle.net\/bob\/hash\/index.html#lookup  http:\/\/burtleburtle.net\/bob\/hash\/index.html#lookup"},{"key":"e_1_3_2_1_18_1","unstructured":"http:\/\/en.wikipedia.org\/wiki\/SHA256  http:\/\/en.wikipedia.org\/wiki\/SHA256"}],"event":{"name":"FPGA '10: ACM\/SIGDA International Symposium on Field Programmable Gate Arrays","sponsor":["SIGDA ACM Special Interest Group on Design Automation"],"location":"Monterey California USA","acronym":"FPGA '10"},"container-title":["Proceedings of the 18th annual ACM\/SIGDA international symposium on Field programmable gate arrays"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1723112.1723145","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1723112.1723145","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:41:15Z","timestamp":1750250475000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1723112.1723145"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,21]]},"references-count":18,"alternative-id":["10.1145\/1723112.1723145","10.1145\/1723112"],"URL":"https:\/\/doi.org\/10.1145\/1723112.1723145","relation":{},"subject":[],"published":{"date-parts":[[2010,2,21]]},"assertion":[{"value":"2010-02-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}