{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T22:01:35Z","timestamp":1729634495830,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1109\/allerton.2017.8262865","type":"proceedings-article","created":{"date-parts":[[2018,1,18]],"date-time":"2018-01-18T23:03:47Z","timestamp":1516316627000},"page":"1139-1144","source":"Crossref","is-referenced-by-count":1,"title":["Reconciling similar sets"],"prefix":"10.1109","author":[{"given":"Ryan","family":"Gabrys","sequence":"first","affiliation":[]},{"given":"Farzad Farnoud","family":"Hassanzadeh","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"crossref","DOI":"10.1145\/2043164.2018462","article-title":"What's the difference? Efficient set reconciliation without prior context","author":"eppstein","year":"2011","journal-title":"SIGCOMM"},{"journal-title":"Invertible Bloom Lookup Tables","year":"2011","author":"goodrich","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2146330"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.215"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875244"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610528"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282974"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-52282-4_44"},{"key":"ref3","first-page":"3","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"gabidulin","year":"1985","journal-title":"Probl Peredachi Inf"},{"journal-title":"Practical Set Reconciliation","year":"2002","author":"minsky","key":"ref6"},{"key":"ref5","volume":"2","author":"west","year":"2001","journal-title":"Introduction to Graph Theory"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.813498"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.815784"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/828.1884"},{"journal-title":"The Theory of Error-Correcting Codes","year":"1977","author":"macwilliams","key":"ref1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511808968"}],"event":{"name":"2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2017,10,3]]},"location":"Monticello, IL, USA","end":{"date-parts":[[2017,10,6]]}},"container-title":["2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8253908\/8262705\/08262865.pdf?arnumber=8262865","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,9]],"date-time":"2019-10-09T14:43:30Z","timestamp":1570632210000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8262865\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/allerton.2017.8262865","relation":{},"subject":[],"published":{"date-parts":[[2017,10]]}}}