{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:07:13Z","timestamp":1750306033655,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,12,8]],"date-time":"2017-12-08T00:00:00Z","timestamp":1512691200000},"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":[[2017,12,8]]},"DOI":"10.1145\/3171592.3171596","type":"proceedings-article","created":{"date-parts":[[2018,3,16]],"date-time":"2018-03-16T12:53:36Z","timestamp":1521204816000},"page":"59-63","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Multiple Bloom filters"],"prefix":"10.1145","author":[{"given":"Yuanhang","family":"Yang","sequence":"first","affiliation":[{"name":"College of Computer Science, National University of Defense Technology, Changsha, P.R.China"}]},{"given":"Shuhui","family":"Chen","sequence":"additional","affiliation":[{"name":"College of Computer Science, National University of Defense Technology, Changsha, P.R.China"}]}],"member":"320","published-online":{"date-parts":[[2017,12,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1982.1095395"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380200607"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11841036_61"},{"key":"e_1_3_2_1_5_1","volume-title":"Network applications of bloom filters: A survey. Internet mathematics 1, 4","author":"Broder Andrei","year":"2004","unstructured":"Andrei Broder and Michael Mitzenmacher . 2004. Network applications of bloom filters: A survey. Internet mathematics 1, 4 ( 2004 ), 485--509. Andrei Broder and Michael Mitzenmacher. 2004. Network applications of bloom filters: A survey. Internet mathematics 1, 4 (2004), 485--509."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872787"},{"key":"e_1_3_2_1_7_1","volume-title":"proceedings. 11th symposium on. IEEE, 44--51","author":"Krishnamurthy Praveen","year":"2003","unstructured":"SarangDharmapurikar, Praveen Krishnamurthy , Todd Sproull , and John Lock-wood. 2003 . Deep packet inspection using parallel bloom filters. In High performance interconnects, 2003 . proceedings. 11th symposium on. IEEE, 44--51 . SarangDharmapurikar, Praveen Krishnamurthy, Todd Sproull, and John Lock-wood. 2003. Deep packet inspection using parallel bloom filters. In High performance interconnects, 2003. proceedings. 11th symposium on. IEEE, 44--51."},{"key":"e_1_3_2_1_8_1","volume-title":"Forty-Fourth Annual Allerton Conf.","author":"Bonomi Flavio","year":"2006","unstructured":"Flavio Bonomi , Michael Mitzenmacher , Rina Panigraphy , Sushil Singh , and George Varghese . 2006 . Bloom filters via d-left hashing and dynamic bit reassignment extended abstract . In Forty-Fourth Annual Allerton Conf. , Illinois, USA. 877--883. Flavio Bonomi, Michael Mitzenmacher, Rina Panigraphy, Sushil Singh, and George Varghese. 2006. Bloom filters via d-left hashing and dynamic bit reassignment extended abstract. In Forty-Fourth Annual Allerton Conf., Illinois, USA. 877--883."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.v33:2"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1070432.1070548"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)00032-8"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-4048(92)90207-8"},{"volume-title":"Dynamic programming and optimal control","author":"Bertsekas Dimitri P","key":"e_1_3_2_1_13_1","unstructured":"Dimitri P Bertsekas , Dimitri P Bertsekas , Dimitri P Bertsekas , and Dimitri P Bert-sekas. 1995. Dynamic programming and optimal control . Vol. 1 . Athena scientific Belmont, MA. Dimitri P Bertsekas, Dimitri P Bertsekas, Dimitri P Bertsekas, and Dimitri P Bert-sekas. 1995. Dynamic programming and optimal control. Vol. 1. Athena scientific Belmont, MA."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.803864"},{"key":"e_1_3_2_1_15_1","unstructured":"A Appleby. 2014. MurmurHash3 http:\/\/code.google.com\/p\/smhasher\/wiki.(2014).  A Appleby. 2014. MurmurHash3 http:\/\/code.google.com\/p\/smhasher\/wiki.(2014)."},{"key":"e_1_3_2_1_16_1","unstructured":"J Hines et al. 2012. dablooms: An open source scalable counting Bloom filter library. (2012).  J Hines et al. 2012. dablooms: An open source scalable counting Bloom filter library. (2012)."}],"event":{"name":"ICNCC 2017: 2017 VI International Conference on Network, Communication and Computing","acronym":"ICNCC 2017","location":"Kunming China"},"container-title":["Proceedings of the 2017 VI International Conference on Network, Communication and Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3171592.3171596","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3171592.3171596","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:02:53Z","timestamp":1750215773000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3171592.3171596"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,8]]},"references-count":16,"alternative-id":["10.1145\/3171592.3171596","10.1145\/3171592"],"URL":"https:\/\/doi.org\/10.1145\/3171592.3171596","relation":{},"subject":[],"published":{"date-parts":[[2017,12,8]]},"assertion":[{"value":"2017-12-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}