254 search results - page 39 / 51 » On randomized one-round communication complexity |
CRYPTO
2001
Springer
14 years 4 days ago
2001
Springer
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
JSAC
2008
13 years 7 months ago
2008
In this paper, we study the theoretical problem of the end-to-end rate assignment for multi-hop wireless networks. Specifically, we consider the problem of joint congestion control...
CCS
2007
ACM
14 years 1 months ago
2007
ACM
A group key agreement protocol (GKA) allows a set of players to establish a shared secret key which can be used to secure a subsequent communication. Several efficient constantrou...
ICC
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract —Previous work demonstrated that the improvements in spectral efficiency and link reliability can be obtained in wireless relay networks employing terminals with MIMO c...
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
Distributed Constraint Satisfaction Problems (DCSPs) provide a model to capture a broad range of cooperative multiagent problem solving settings. Researchers have generally propos...