6 citations · 14 across the 10 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.CC2013★ 3 cited
On the communication complexity of sparse set disjointness and exists-equal problems
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…
cs.CR2013
Optimal information rate of secret sharing schemes on trees
L. Csirmaz, G. Tardos
The information rate for an access structure is the reciprocal of the load of the optimal secret sharing scheme for this structure. We determine this value for all trees: it is 1/(…