50 search results - page 4 / 10 » On the bit communication complexity of randomized rumor spre... |
COCO
2009
Springer
14 years 3 months ago
2009
Springer
—We study the one-way number-on-the-forhead (NOF) communication complexity of the k-layer pointer jumping problem. Strong lower bounds for this problem would have important impli...
TCOM
2010
13 years 7 months ago
2010
- Phase noise is a topic of theoretical and practical interest in electronic circuits. Although progress has been made in the characterization of its description, there are still c...
JSAC
2006
13 years 8 months ago
2006
We consider a code-spread and chip-interleaved time-hopping (TH) multiple-access scheme for multiuser ultra-wideband (UWB) communications. In such a system, each user's chip s...
ICALP
2007
Springer
14 years 2 months ago
2007
Springer
This paper studies the gap between classical one-way communication complexity C(f) and its quantum counterpart Q(f), under the unbounded-error setting, i.e., it is enough that the ...
COCO
2007
Springer
14 years 2 months ago
2007
Springer
We examine the communication required for generating random variables remotely. One party Alice will be given a distribution D, and she has to send a message to Bob, who is then r...