10 citations · 13 across the 3 of their papers we have counts for
1 paper · 1 filter
Mert Saglam, Gabor Tardos
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…