{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:05:54Z","timestamp":1725530754706},"reference-count":21,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1109\/allerton.2017.8262764","type":"proceedings-article","created":{"date-parts":[[2018,1,18]],"date-time":"2018-01-18T23:03:47Z","timestamp":1516316627000},"page":"390-396","source":"Crossref","is-referenced-by-count":0,"title":["Two-party function computation on the reconciled data"],"prefix":"10.1109","author":[{"given":"Ivo","family":"Kubjas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vitaly","family":"Skachek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1016\/S0065-2458(08)60342-3"},{"year":"1997","author":"kushilevitz","journal-title":"Communication Complexity","key":"ref11"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1145\/800076.802482"},{"key":"ref13","article-title":"Communication complexity: a survey","author":"lov\u00e1sz","year":"1990","journal-title":"Paths Flows and VLSI Layout"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1109\/TIT.2003.815784"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1109\/ISIT.2012.6284236"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1109\/Allerton.2012.6483345"},{"key":"ref17","article-title":"Coding for computing","author":"orlitsky","year":"1995","journal-title":"Proceedings of the 36th Annual Symposium on the Foundations of Computer Science (FOCS)"},{"key":"ref18","first-page":"16","article-title":"Communication complexity","author":"orlitsky","year":"1988","journal-title":"Complexity in Information Theory"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1016\/0304-3975(92)90260-M"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1145\/2043164.2018462","article-title":"What's the difference? Efficient set reconciliation without prior context","author":"eppstein","year":"2011","journal-title":"Proc ACM Sigcomm"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1016\/0022-0000(79)90044-8"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.4086\/toc.2007.v003a011"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1109\/Allerton.2011.6120248"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1137\/0405044"},{"key":"ref7","article-title":"Extremal Combinatorics - With Applications in Computer Science","author":"jukna","year":"2011","journal-title":"Texts in Theoretical Computer Science"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1145\/2611462.2611501"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1016\/j.jcss.2003.11.006"},{"year":"2014","author":"kubjas","journal-title":"Set reconciliation","key":"ref9"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1109\/ISIT.2014.6875244"},{"key":"ref21","first-page":"209","article-title":"Some Complexity Questions Related to Distributed Computing","author":"yao","year":"1979","journal-title":"Proceedings of the 11th ACM Symposium on Theory of Computing (STOC)"}],"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\/08262764.pdf?arnumber=8262764","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,9]],"date-time":"2019-10-09T14:43:38Z","timestamp":1570632218000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8262764\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/allerton.2017.8262764","relation":{},"subject":[],"published":{"date-parts":[[2017,10]]}}}