Multiparty equality function computation in networks with point-to-point links

Guanfeng Liang, Nitin Vaidya

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, we study the problem of computing the multiparty equality (MEQ) function: n≥2 nodes, each of which is given an input value from {1,⋯,K}, determine if their inputs are all identical, under the point-to-point communication model. The MEQ function equals to 1 if and only if all n inputs are identical, and 0 otherwise. The communication complexity of the MEQ problem is defined as the minimum number of bits communicated in the worst case. It is easy to show that (n-1)log2 K bits is an upper bound, by constructing a simple algorithm with that cost. In this paper, we demonstrate that communication cost strictly lower than this upper bound can be achieved. We show this by constructing a static protocol that solves the MEQ problem for n=3, K=6, of which the communication cost is strictly lower than the above upper bound (2log2 6 bits). This result is then generalized for large values of n and K.

Original languageEnglish (US)
Title of host publicationStructural Information and Communication Complexity - 18th International Colloquium, SIROCCO 2011, Proceedings
Pages258-269
Number of pages12
DOIs
StatePublished - Aug 10 2011
Event18th Colloquium on Structural Information and Communication Complexity, SIROCCO 2011 - Gdansk, Poland
Duration: Jun 26 2011Jun 29 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6796 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other18th Colloquium on Structural Information and Communication Complexity, SIROCCO 2011
CountryPoland
CityGdansk
Period6/26/116/29/11

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Multiparty equality function computation in networks with point-to-point links'. Together they form a unique fingerprint.

  • Cite this

    Liang, G., & Vaidya, N. (2011). Multiparty equality function computation in networks with point-to-point links. In Structural Information and Communication Complexity - 18th International Colloquium, SIROCCO 2011, Proceedings (pp. 258-269). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6796 LNCS). https://doi.org/10.1007/978-3-642-22212-2_23