50 search results - page 6 / 10 » On the bit communication complexity of randomized rumor spre... |
COCO
2004
Springer
15 years 2 months ago
2004
Springer
Entanglement is an essential resource for quantum communication and quantum computation, similar to shared random bits in the classical world. Entanglement distillation extracts n...
WIMOB
2008
IEEE
15 years 3 months ago
2008
IEEE
—Based on the principle of spread spectrum systems, this paper presents a hybrid automatic-repeat-request (HARQ) scheme with the mitigation of intercarrier interference (ICI) by ...
COCO
2009
Springer
15 years 1 months ago
2009
Springer
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...
CC
2007
Springer
14 years 9 months ago
2007
Springer
We initiate a study of tradeoffs between communication and computation in well-known communication models and in other related models. The fundamental question we investigate is t...
PKC
2007
Springer
15 years 3 months ago
2007
Springer
Damg˚ard et al. [11] showed a novel technique to convert a polynomial sharing of secret a into the sharings of the bits of a in constant rounds, which is called the bit-decomposit...