PODC
2012
ACM
11 years 7 months ago
2012
ACM
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
STOC
1991
ACM
13 years 8 months ago
1991
ACM
The k-round two-party communication complexity was studied in the deterministic model by [14] and [4] and in the probabilistic model by [20] and [6]. We present new lower bounds th...
STOC
1990
ACM
13 years 8 months ago
1990
ACM
We prove that monotone circuits computing the perfect matching function on n-vertex graphs require (n) depth. This implies an exponential gap between the depth of monotone and non...