{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T23:19:08Z","timestamp":1768346348464,"version":"3.49.0"},"reference-count":13,"publisher":"IEEE","license":[{"start":{"date-parts":[[2009,4,1]],"date-time":"2009-04-01T00:00:00Z","timestamp":1238544000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2009,4,1]],"date-time":"2009-04-01T00:00:00Z","timestamp":1238544000000},"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":[[2009,4]]},"DOI":"10.1109\/infcom.2009.5061957","type":"proceedings-article","created":{"date-parts":[[2009,6,3]],"date-time":"2009-06-03T15:10:14Z","timestamp":1244041814000},"page":"513-521","source":"Crossref","is-referenced-by-count":30,"title":["Fast Multiset Membership Testing Using Combinatorial Bloom Filters"],"prefix":"10.1109","author":[{"given":"F.","family":"Hao","sequence":"first","affiliation":[{"name":"Bell Labs., Alcatel Lucent, Holmdel, NJ"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Kodialam","sequence":"additional","affiliation":[{"name":"Bell Labs., Alcatel Lucent, Holmdel, NJ"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T. V.","family":"Lakshman","sequence":"additional","affiliation":[{"name":"Bell Labs., Alcatel Lucent, Holmdel, NJ"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Song","sequence":"additional","affiliation":[{"name":"Bell Labs., Alcatel Lucent, Holmdel, NJ"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"13","article-title":"a performance study of hashing functions for hardware applications","author":"ramakrishna","year":"1994","journal-title":"Proc 6th Int'l Conf Computing and Information"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.242"},{"key":"12","author":"rains","year":"0","journal-title":"Table of constant weight binary codes"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/1185347.1185356"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/1140277.1140314"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2008.923720"},{"key":"10","article-title":"the bloomier filter: an efficient data structure for static support lookup tables","author":"chazelle","year":"2004","journal-title":"ACM-SIAM Symposium on Discrete Algorithms (SODA)"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.29"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1354643"},{"key":"5","article-title":"dynamic perfect hashing: upper and lower bounds","author":"dietzfelbinger","year":"1990","journal-title":"SIAM J Computing"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2006.877131"},{"key":"9","article-title":"bloom filters: design innovations and novel applications","author":"lu","year":"2005","journal-title":"Allerton Conference"},{"key":"8","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1145\/1095890.1095904","article-title":"Segmented hash","author":"kumar","year":"2005","journal-title":"2005 Symposium on Architectures for Networking and Communications Systems (ANCS) ANCS"}],"event":{"name":"2009 Proceedings IEEE INFOCOM","location":"Rio de Janeiro, Brazil","start":{"date-parts":[[2009,4,19]]},"end":{"date-parts":[[2009,4,25]]}},"container-title":["IEEE INFOCOM 2009"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5061887\/5061888\/05061957.pdf?arnumber=5061957","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T18:23:42Z","timestamp":1677781422000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/5061957\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,4]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/infcom.2009.5061957","relation":{},"subject":[],"published":{"date-parts":[[2009,4]]}}}