{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:48:43Z","timestamp":1772164123321,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T00:00:00Z","timestamp":1717977600000},"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":[[2024,6,10]]},"DOI":"10.1145\/3652963.3655060","type":"proceedings-article","created":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T18:21:15Z","timestamp":1717266075000},"page":"19-20","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Invertible Bloom Lookup Tables with Listing Guarantees"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5715-724X","authenticated-orcid":false,"given":"Avi","family":"Mizrahi","sequence":"first","affiliation":[{"name":"Technion - Israel Institute of Technology, Haifa, Israel"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6766-1450","authenticated-orcid":false,"given":"Daniella","family":"Bar-Lev","sequence":"additional","affiliation":[{"name":"Technion - Israel Institute of Technology, Haifa, Israel"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9851-5234","authenticated-orcid":false,"given":"Eitan","family":"Yaakobi","sequence":"additional","affiliation":[{"name":"Technion - Israel Institute of Technology, Haifa, Israel"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4064-1238","authenticated-orcid":false,"given":"Ori","family":"Rottenstreich","sequence":"additional","affiliation":[{"name":"Technion - Israel Institute of Technology, Haifa, Israel"}]}],"member":"320","published-online":{"date-parts":[[2024,6,10]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Allerton Conference on Communication, Control, and Computing","author":"Michael","year":"2011","unstructured":"Michael T. Goodrich and Michael Mitzenmacher. Invertible bloom lookup tables. In Allerton Conference on Communication, Control, and Computing, 2011."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2999572.2999609"},{"key":"e_1_3_2_1_3_1","volume-title":"USENIX Symposium on Networked Systems Design and Implementation (NSDI)","author":"Li Yuliang","year":"2016","unstructured":"Yuliang Li, Rui Miao, Changhoon Kim, and Minlan Yu. Flowradar: A better netflow for data centers. In USENIX Symposium on Networked Systems Design and Implementation (NSDI), 2016."},{"key":"e_1_3_2_1_4_1","volume-title":"IEEE International Symposium on Information Theory (ISIT)","author":"Mitzenmacher Michael","year":"2012","unstructured":"Michael Mitzenmacher and George Varghese. Biff (Bloom filter) codes: Fast error correction for large data sets. In IEEE International Symposium on Information Theory (ISIT), 2012."},{"key":"e_1_3_2_1_5_1","volume-title":"ACM SIGCOMM","author":"Eppstein David","year":"2011","unstructured":"David Eppstein, Michael T. Goodrich, Frank Uyeda, and George Varghese. What's the difference?: Efficient set reconciliation without prior context. In ACM SIGCOMM, 2011."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-017-0316-0"},{"key":"e_1_3_2_1_7_1","volume-title":"ACM SIGCOMM","author":"Ozisik A. Pinar","year":"2019","unstructured":"A. Pinar Ozisik, Gavin Andresen, Brian Neil Levine, Darren Tapp, George Bissias, and Sunny Katkuri. Graphene: Efficient interactive set reconciliation applied to blockchain propagation. In ACM SIGCOMM, 2019."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8486415"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2021.3068604"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.883542"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2023736"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2006.888633"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511808968"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780198535768.001.0001"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(95)90015-2"}],"event":{"name":"SIGMETRICS\/PERFORMANCE '24: ACM SIGMETRICS\/IFIP PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems","location":"Venice Italy","acronym":"SIGMETRICS\/PERFORMANCE '24","sponsor":["SIGMETRICS ACM Special Interest Group on Measurement and Evaluation"]},"container-title":["Abstracts of the 2024 ACM SIGMETRICS\/IFIP PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3652963.3655060","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3652963.3655060","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T21:17:58Z","timestamp":1750281478000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3652963.3655060"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,10]]},"references-count":15,"alternative-id":["10.1145\/3652963.3655060","10.1145\/3652963"],"URL":"https:\/\/doi.org\/10.1145\/3652963.3655060","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/3673660.3655060","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2024,6,10]]},"assertion":[{"value":"2024-06-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}