{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T04:41:29Z","timestamp":1725424889496},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1109\/isit.2013.6620782","type":"proceedings-article","created":{"date-parts":[[2013,10,11]],"date-time":"2013-10-11T22:57:32Z","timestamp":1381532252000},"page":"3030-3034","source":"Crossref","is-referenced-by-count":0,"title":["Finite length analysis on listing failure probability of Invertible Bloom Lookup Tables"],"prefix":"10.1109","author":[{"given":"Daichi","family":"Yugawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tadashi","family":"Wadayama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"year":"0","key":"13"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003839"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.132"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/1498698.1594230"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120248"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.803864"},{"key":"7","first-page":"684","article-title":"An improved construction for counting Bloom filters","author":"bonomi","year":"2006","journal-title":"Proceedings of the European Symposium on Algorithms (ESA) 4168 of LNCS"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/1151659.1159950"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284236"},{"key":"9","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 Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2004.10129096"}],"event":{"name":"2013 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2013,7,7]]},"location":"Istanbul, Turkey","end":{"date-parts":[[2013,7,12]]}},"container-title":["2013 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6597029\/6620166\/06620782.pdf?arnumber=6620782","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T11:24:53Z","timestamp":1602674693000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6620782"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/isit.2013.6620782","relation":{},"subject":[],"published":{"date-parts":[[2013,7]]}}}