24421 search results - page 59 / 4885 » Communicating Complex Systems |
151
click to vote
ECCC
2011
14 years 9 months ago
2011
We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for r...
123
click to vote
SPAA
2010
ACM
15 years 2 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...
119
Voted
STOC
2006
ACM
16 years 2 months ago
2006
ACM
We consider the problem of bounded-error quantum state identification: given either state 0 or state 1, we are required to output `0', `1' or `?' ("don't ...
123
click to vote
ICDCN
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. We re-visit the problem of perfectly secure message transmission (PSMT) in a directed network under the presence of a threshold adaptive Byzantine adversary, having unbou...
132
click to vote
CORR
2010
Springer
15 years 29 days ago
2010
Springer
A strong direct product theorem (SDPT) states that solving n instances of a problem requires ˝.n/ times the resources for a single instance, even to achieve success probability 2 ...