254 search results - page 2 / 51 » On randomized one-round communication complexity |
STOC
1992
ACM
15 years 1 months ago
1992
ACM
Paul Beame Joan Lawry Department of Computer Science and Engineering, FR-35 University of Washington Seattle, Washington 98195 Our main result is the demonstration of a Boolean fu...
126
click to vote
CC
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
SPAA
2010
ACM
14 years 9 months ago
2010
ACM
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
STOC
1995
ACM
15 years 1 months ago
1995
ACM
TOC
2010
14 years 4 months ago
2010