A Tight Bound for Set Disjointness in the Message-Passing Model

  title={A Tight Bound for Set Disjointness in the Message-Passing Model},
  author={Mark Braverman and Faith Ellen and Rotem Oshman and Toniann Pitassi and Vinod Vaikuntanathan},
  journal={2013 IEEE 54th Annual Symposium on Foundations of Computer Science},
In a multiparty message-passing model of communication, there are k players. Each player has a private input, and they communicate by sending messages to one another over private channels. While this model has been used extensively in distributed computing and in secure multiparty computation, lower bounds on communication complexity in this model and related models have been somewhat scarce. In recent work [25], [29], [30], strong lower bounds of the form Ω(n·k) were obtained for several… CONTINUE READING
Highly Cited
This paper has 60 citations. REVIEW CITATIONS
Recent Discussions
This paper has been referenced on Twitter 3 times over the past 90 days. VIEW TWEETS

From This Paper

Topics from this paper.


Publications citing this paper.

61 Citations

Citations per Year
Semantic Scholar estimates that this publication has 61 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…