{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T16:54:19Z","timestamp":1780073659629,"version":"3.54.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642222115","type":"print"},{"value":"9783642222122","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22212-2_23","type":"book-chapter","created":{"date-parts":[[2011,7,21]],"date-time":"2011-07-21T07:22:50Z","timestamp":1311232970000},"page":"258-269","source":"Crossref","is-referenced-by-count":5,"title":["Multiparty Equality Function Computation in Networks with Point-to-Point Links"],"prefix":"10.1007","author":[{"given":"Guanfeng","family":"Liang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nitin","family":"Vaidya","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. In: STOC (1996)","DOI":"10.1145\/237814.237823"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Bar-yossef, Z., Jayram, T.S., Kumar, R., Sivakumar, D.: An information statistics approach to data stream and communication complexity. In: IEEE FOCS, pp. 209\u2013218 (2002)","DOI":"10.1109\/SFCS.2002.1181944"},{"key":"23_CR3","unstructured":"Chakrabarti, A., Khot, S., Sun, X.: Near-optimal lower bounds on the multi-party communication complexity of set disjointness. In: IEEE CCC (2003)"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Chandra, A.K., Merrick, I., Furst, L., Lipton, R.J.: Multi-party protocols. In: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, pp. 94\u201399 (1983)","DOI":"10.1145\/800061.808737"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S1570-8667(03)00024-8","volume":"1","author":"Y. Dinitz","year":"2003","unstructured":"Dinitz, Y., Moran, S., Rajsbaum, S.: Exact communication costs for consensus and leader in a tree. J. of Discrete Algorithms\u00a01, 167\u2013183 (2003)","journal-title":"J. of Discrete Algorithms"},{"key":"23_CR6","volume-title":"Communication Complexity","author":"E. Kushilevitz","year":"2006","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (2006)"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Weinreb, E.: The communication complexity of set-disjointness with small sets and 0-1 intersection. In: IEEE FOCS (2009)","DOI":"10.1109\/FOCS.2009.15"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Lamport, L., Shostak, R., Pease, M.: The byzantine generals problem. ACM Trans. on Programming Languages and Systems (1982)","DOI":"10.1145\/357172.357176"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Liang, G., Vaidya, N.: Complexity of multi-valued byzantine agreement. Technical Report, CSL, UIUC (June 2010), http:\/\/arxiv.org\/abs\/1006.2422","DOI":"10.21236\/ADA555114"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Liang, G., Vaidya, N.: Multiparty equality function computation in networks with point-to-point links. Technical Report, CSL, UIUC (2010)","DOI":"10.21236\/ADA555116"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"P\u0103tra\u015fcu, M., Williams, R.: On the possibility of faster sat algorithms. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA \u201910, pp. 1065\u20131075, Philadelphia, PA, USA, Society for Industrial and Applied Mathematics (2010)","DOI":"10.1137\/1.9781611973075.86"},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/800135.804414","volume-title":"STOC 1979: Proceedings of the Eleventh Annual ACM Symposium on Theory of Computing","author":"A.C.-C. Yao","year":"1979","unstructured":"Yao, A.C.-C.: Some complexity questions related to distributive computing(preliminary report). In: STOC 1979: Proceedings of the Eleventh Annual ACM Symposium on Theory of Computing, pp. 209\u2013213. ACM, New York (1979)"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22212-2_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,7]],"date-time":"2025-03-07T07:14:21Z","timestamp":1741331661000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22212-2_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642222115","9783642222122"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22212-2_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}