{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:08Z","timestamp":1740109268670,"version":"3.37.3"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"11-12","license":[{"start":{"date-parts":[[2018,7,20]],"date-time":"2018-07-20T00:00:00Z","timestamp":1532044800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["2022103"],"award-info":[{"award-number":["2022103"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s00453-018-0484-8","type":"journal-article","created":{"date-parts":[[2018,7,20]],"date-time":"2018-07-20T08:46:50Z","timestamp":1532076410000},"page":"4200-4237","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Information Complexity of the AND Function in the Two-Party and Multi-party Settings"],"prefix":"10.1007","volume":"81","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"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9043-0375","authenticated-orcid":false,"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":[[2018,7,20]]},"reference":[{"issue":"4","key":"484_CR1","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1016\/j.jcss.2003.11.006","volume":"68","author":"Z Bar-Yossef","year":"2004","unstructured":"Bar-Yossef, Z., Jayram, T.S., Kumar, R., Sivakumar, D.: An information statistics approach to data stream and communication complexity. J. Comput. Syst. Sci. 68(4), 702\u2013732 (2004)","journal-title":"J. Comput. Syst. Sci."},{"key":"484_CR2","doi-asserted-by":"crossref","unstructured":"Braverman, M., Garg, A., Pankratov, D., Weinstein, O.: From information to exact communication (extended abstract). In: STOC\u201913, pp. 151\u2013160. ACM (2013)","DOI":"10.1145\/2488608.2488628"},{"issue":"2","key":"484_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":"484_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. Inf. Theory 60(10), 6058\u20136069 (2014)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"484_CR5","unstructured":"Chakrabarti, A., Khot, S., Sun, X.: Near-optimal lower bounds on the multi-party communication complexity of set disjointness. In: Proceedings of 18th IEEE Annual Conference on Computational Complexity, 2003., pp. 107\u2013117. IEEE (2003)"},{"key":"484_CR6","volume-title":"Elements of Information Theory","author":"TM Cover","year":"2012","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley, Hoboken (2012)"},{"issue":"6","key":"484_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4086\/toc.2018.v014a006","volume":"14","author":"Y Dagan","year":"2018","unstructured":"Dagan, Y., Filmus, Y., Hatami, H., Li, Y.: Trading information complexity for error. Theor. Comput. 14(6), 1\u201373 (2018)","journal-title":"Theor. Comput."},{"key":"484_CR8","doi-asserted-by":"crossref","unstructured":"Gronemeier, A.: Nof-multiparty information complexity bounds for pointer jumping. In: International Symposium on Mathematical Foundations of Computer Science, pp. 459\u2013470. Springer (2006)","DOI":"10.1007\/11821069_40"},{"key":"484_CR9","unstructured":"Gronemeier, A.: Asymptotically optimal lower bounds on the nih-multi-party information. arXiv preprint \n                    arXiv:0902.1609\n                    \n                   (2009)"},{"key":"484_CR10","volume-title":"Communication Complexity","author":"E Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)"},{"issue":"9","key":"484_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. Inf. Theory 57(9), 6180\u20136195 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"484_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. Inf. Theory 59(7), 4071\u20134094 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"484_CR13","unstructured":"Pankratov, D.: Communication complexity and information complexity. Ph.D. thesis, The University of Chicago (2015)"},{"issue":"2","key":"484_CR14","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. Theor. Comput. Sci. 106(2), 385\u2013390 (1992)","journal-title":"Theor. Comput. Sci."},{"key":"484_CR15","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: Some complexity questions related to distributive computing(preliminary report). STOC\u201979, pp. 209\u2013213. ACM (1979)","DOI":"10.1145\/800135.804414"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-018-0484-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-018-0484-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-018-0484-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,12]],"date-time":"2019-10-12T04:17:37Z","timestamp":1570853857000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-018-0484-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,20]]},"references-count":15,"journal-issue":{"issue":"11-12","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["484"],"URL":"https:\/\/doi.org\/10.1007\/s00453-018-0484-8","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2018,7,20]]},"assertion":[{"value":"13 September 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 July 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 July 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}