{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T21:40:39Z","timestamp":1740260439799,"version":"3.37.3"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,5]]},"DOI":"10.1109\/icc.2010.5501806","type":"proceedings-article","created":{"date-parts":[[2010,7,12]],"date-time":"2010-07-12T14:22:30Z","timestamp":1278944550000},"page":"1-5","source":"Crossref","is-referenced-by-count":3,"title":["Achieving Perfect Hashing through an Improved Construction of Bloom Filters"],"prefix":"10.1109","author":[{"given":"G.","family":"Antichi","sequence":"first","affiliation":[]},{"given":"A.","family":"Di Pietro","sequence":"additional","affiliation":[]},{"given":"D.","family":"Ficara","sequence":"additional","affiliation":[]},{"given":"S.","family":"Giordano","sequence":"additional","affiliation":[]},{"given":"F.","family":"Russo","sequence":"additional","affiliation":[]},{"given":"F.","family":"Vitucci","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2008.ECP.305"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2008.1090"},{"key":"ref12","first-page":"30","article-title":"The bloomier filter: An efficient data structure for static support lookup tables","author":"chazelle","year":"2004","journal-title":"Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)"},{"key":"ref13","first-page":"26","article-title":"On representatives of subsets","volume":"10","author":"hall","year":"1936","journal-title":"J London Math Soc"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/195613.195663"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/0202019"},{"key":"ref16","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3927.001.0001","author":"mitchell","year":"1996","journal-title":"An Introduction to Genetic Algorithms"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/HPSR.2009.5307428"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/863977.863979"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1080091.1080114"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2004.1268997"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1185347.1185359"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2007.4375855"},{"key":"ref2","article-title":"Network applications of bloom filters: A survey","volume":"1","author":"broder","year":"2005","journal-title":"Internet Mathematics"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1882486.1882519"}],"event":{"name":"ICC 2010 - 2010 IEEE International Conference on Communications","start":{"date-parts":[[2010,5,23]]},"location":"Cape Town, South Africa","end":{"date-parts":[[2010,5,27]]}},"container-title":["2010 IEEE International Conference on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5497983\/5501741\/05501806.pdf?arnumber=5501806","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T21:14:59Z","timestamp":1740258899000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5501806\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/icc.2010.5501806","relation":{},"subject":[],"published":{"date-parts":[[2010,5]]}}}