On the Communication Complexity of Sparse Set Disjointness and Exists-Equal Problems

@article{Saglam2013OnTC,
  title={On the Communication Complexity of Sparse Set Disjointness and Exists-Equal Problems},
  author={Mert Saglam and G{\'a}bor Tardos},
  journal={2013 IEEE 54th Annual Symposium on Foundations of Computer Science},
  year={2013},
  pages={678-687}
}
In this paper we study the two player randomized communication complexity of the sparse set disjointness and the exists-equal problems and give matching lower and upper bounds (up to constant factors) for any number of rounds for both of these problems. In the sparse set disjointness problem, each player receives a k-subset of [m] and the goal is to determine whether the sets intersect. For this problem, we give a protocol that communicates a total of O(k log(r) k) bits over r rounds and errs… CONTINUE READING
Highly Cited
This paper has 27 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 20 extracted citations

Near log-convexity of measured heat in (discrete) time and consequences

Electronic Colloquium on Computational Complexity • 2018

A Rounds vs. Communication Tradeoff for Multi-Party Set Disjointness

2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) • 2017
View 2 Excerpts

Distributively Computing Random Walk Betweenness Centrality in Linear Time

2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS) • 2017
View 1 Excerpt

Nearly Optimal Distributed Algorithm for Computing Betweenness Centrality

2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS) • 2016
View 2 Excerpts

References

Publications referenced by this paper.
Showing 1-10 of 51 references

The Randomized Communication Complexity of Set Disjointness

Theory of Computing • 2007
View 6 Excerpts
Highly Influenced

Cc4: One-way communication and a puzzle

Mihai Pătraşcu
http://infoweekly. blogspot.com/2009/04/cc4-one-way-communication-and-puzzle.html • 2013
View 1 Excerpt

On the communication complexity of sparse set disjointness and exists-equal problems

Mert Saglam, Gábor Tardos
CoRR, abs/1304.1217, • 2013
View 1 Excerpt

Similar Papers

Loading similar papers…