{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:01:39Z","timestamp":1742943699524,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319623887"},{"type":"electronic","value":"9783319623894"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-62389-4_17","type":"book-chapter","created":{"date-parts":[[2017,6,30]],"date-time":"2017-06-30T15:07:46Z","timestamp":1498835266000},"page":"200-211","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Information Complexity of the AND Function in the Two-Party and Multi-party Settings"],"prefix":"10.1007","author":[{"given":"Yuval","family":"Filmus","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hamed","family":"Hatami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaqiao","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Suzin","family":"You","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,1]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Barak, B., Braverman, M., Chen, X., Rao, A.: How to compress interactive communication [extended abstract]. In: STOC 2010, pp. 67\u201376. ACM, New York (2010)","DOI":"10.1145\/1806689.1806701"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Braverman, M., Garg, A., Pankratov, D., Weinstein, O.: From information to exact communication (extended abstract). In: STOC 2013, pp. 151\u2013160. ACM, New York (2013)","DOI":"10.1145\/2488608.2488628"},{"issue":"2","key":"17_CR3","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s00224-015-9655-z","volume":"59","author":"M Braverman","year":"2016","unstructured":"Braverman, M., Garg, A., Pankratov, D., Weinstein, O.: Information lower bounds via self-reducibility. Theory Comput. Syst. 59(2), 377\u2013396 (2016)","journal-title":"Theory Comput. Syst."},{"issue":"10","key":"17_CR4","doi-asserted-by":"publisher","first-page":"6058","DOI":"10.1109\/TIT.2014.2347282","volume":"60","author":"M Braverman","year":"2014","unstructured":"Braverman, M., Rao, A.: Information equals amortized communication. IEEE Trans. Inform. Theory 60(10), 6058\u20136069 (2014)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"17_CR5","unstructured":"Braverman, M., Schneider, J.: Information complexity is computable, arXiv preprint arXiv:1502.02971 (2015)"},{"key":"17_CR6","volume-title":"Elements of Information Theory","author":"TM Cover","year":"2012","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley, New York (2012)"},{"key":"17_CR7","unstructured":"Dagan, Y., Filmus, Y.: Grid protocols (2016, in preparation)"},{"key":"17_CR8","unstructured":"Dagan, Y., Filmus, Y., Hatami, H., Li, Y.: Trading information complexity for error, arXiv preprint arXiv:1611.06650 (2016)"},{"key":"17_CR9","unstructured":"Gronemeier, A.: Asymptotically optimal lower bounds on the nih-multi-party information, arXiv preprint arXiv:0902.1609 (2009)"},{"key":"17_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/S0065-2458(08)60342-3","volume-title":"Communication Complexity","author":"E Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)"},{"issue":"9","key":"17_CR11","doi-asserted-by":"publisher","first-page":"6180","DOI":"10.1109\/TIT.2011.2161916","volume":"57","author":"N Ma","year":"2011","unstructured":"Ma, N., Ishwar, P.: Some results on distributed source coding for interactive function computation. IEEE Trans. Inform. Theory 57(9), 6180\u20136195 (2011)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"7","key":"17_CR12","doi-asserted-by":"publisher","first-page":"4071","DOI":"10.1109\/TIT.2013.2251412","volume":"59","author":"N Ma","year":"2013","unstructured":"Ma, N., Ishwar, P.: The infinite-message limit of two-terminal interactive source coding. IEEE Trans. Inform. Theory 59(7), 4071\u20134094 (2013)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"17_CR13","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/0304-3975(92)90260-M","volume":"106","author":"AA Razborov","year":"1992","unstructured":"Razborov, A.A.: On the distributional complexity of disjointness. Theoret. Comput. Sci. 106(2), 385\u2013390 (1992)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Some complexity questions related to distributive computing (preliminary report). In: STOC 1979, pp. 209\u2013213. ACM (1979)","DOI":"10.1145\/800135.804414"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-62389-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:24:20Z","timestamp":1709810660000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-62389-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319623887","9783319623894"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62389-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"1 July 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 August 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 August 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon2017.comp.polyu.edu.hk\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}