{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:32:36Z","timestamp":1750221156611,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,5,27]],"date-time":"2018-05-27T00:00:00Z","timestamp":1527379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1228598,CCF-1320231,CCF-1563710,CCF-1535795"],"award-info":[{"award-number":["CNS-1228598,CCF-1320231,CCF-1563710,CCF-1535795"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,5,27]]},"DOI":"10.1145\/3196959.3196988","type":"proceedings-article","created":{"date-parts":[[2018,5,15]],"date-time":"2018-05-15T12:26:14Z","timestamp":1526387174000},"page":"33-47","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Reconciling Graphs and Sets of Sets"],"prefix":"10.1145","author":[{"given":"Michael","family":"Mitzenmacher","sequence":"first","affiliation":[{"name":"Harvard University, Cambridge, MA, USA"}]},{"given":"Tom","family":"Morgan","sequence":"additional","affiliation":[{"name":"Harvard University, Cambridge, MA, USA"}]}],"member":"320","published-online":{"date-parts":[[2018,5,27]]},"reference":[{"unstructured":"rsync. https:\/\/rsync.samba.org.  rsync. https:\/\/rsync.samba.org.","key":"e_1_3_2_1_1_1"},{"key":"e_1_3_2_1_2_1","volume-title":"The Design and Analysis of Computer Algorithms","author":"Aho Alfred V.","year":"1974","unstructured":"Alfred V. Aho , John E. Hopcroft , and Jeffrey D. Ullman . The Design and Analysis of Computer Algorithms . Addison-Wesley Pub . Co., 1974 . Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley Pub. Co., 1974."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1145\/2897518.2897542"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1137\/0209047"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1109\/SFCS.1979.8"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1016\/j.tcs.2004.12.030"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1007\/978-1-4612-0619-4_7"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1109\/ALLERTON.2014.7028589"},{"key":"e_1_3_2_1_9_1","first-page":"21","volume-title":"Proceedings of Compression and Complexity of Sequences","author":"Broder Andrei","year":"1997","unstructured":"Andrei Broder . On the resemblance and containment of documents . In Proceedings of Compression and Complexity of Sequences , pages 21 -- 29 , 1997 . Andrei Broder. On the resemblance and containment of documents. In Proceedings of Compression and Complexity of Sequences, pages 21--29, 1997."},{"key":"e_1_3_2_1_10_1","volume-title":"Proceedings of the 2nd Electrotechnical and Computer Science Conference","author":"Brodnik Andrej","year":"1993","unstructured":"Andrej Brodnik . Computation of the least significant set bit . In Proceedings of the 2nd Electrotechnical and Computer Science Conference , 1993 . Andrej Brodnik. Computation of the least significant set bit. In Proceedings of the 2nd Electrotechnical and Computer Science Conference, 1993."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1016\/j.jda.2007.01.002"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1109\/TKDE.2010.132"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1007\/978-3-319-45871-7_18"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1145\/2043164.2018462"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1016\/0022-0000(93)90040-4"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1109\/Allerton.2011.6120248"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1016\/j.spl.2013.12.009"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1109\/INFCOM.2005.1498448"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1145\/1807085.1807094"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.14778\/2794367.2794371"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1109\/ALLERTON.2015.7446983"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.14778\/2732269.2732274"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1109\/TIT.2003.815784"},{"key":"e_1_3_2_1_24_1","volume-title":"Simple multi-party set reconciliation. arXiv preprint arXiv:1311.2037","author":"Mitzenmacher Michael","year":"2013","unstructured":"Michael Mitzenmacher and Rasmus Pagh . Simple multi-party set reconciliation. arXiv preprint arXiv:1311.2037 , 2013 . Michael Mitzenmacher and Rasmus Pagh. Simple multi-party set reconciliation. arXiv preprint arXiv:1311.2037, 2013."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1016\/0020-0190(91)90157-D"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1145\/322217.322225"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.1109\/TMC.2003.1195150"},{"unstructured":"Andre Trigdell and Paul Mackerras. The rsync algorithm. https:\/\/rsync.samba.org\/tech_report\/.  Andre Trigdell and Paul Mackerras. The rsync algorithm. https:\/\/rsync.samba.org\/tech_report\/.","key":"e_1_3_2_1_28_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_29_1","DOI":"10.1109\/INFOCOM.2008.40"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_30_1","DOI":"10.1145\/2512938.2512952"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_31_1","DOI":"10.1007\/3-540-09519-5_73"}],"event":{"sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"acronym":"SIGMOD\/PODS '18","name":"SIGMOD\/PODS '18: International Conference on Management of Data","location":"Houston TX USA"},"container-title":["Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3196959.3196988","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3196959.3196988","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3196959.3196988","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:08:35Z","timestamp":1750208915000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3196959.3196988"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,27]]},"references-count":31,"alternative-id":["10.1145\/3196959.3196988","10.1145\/3196959"],"URL":"https:\/\/doi.org\/10.1145\/3196959.3196988","relation":{},"subject":[],"published":{"date-parts":[[2018,5,27]]},"assertion":[{"value":"2018-05-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}