222 search results - page 43 / 45 » Lower Bounds on Quantum Multiparty Communication Complexity |
INFOCOM
2007
IEEE
14 years 2 months ago
2007
IEEE
— We propose a general family of MAC scheduling algorithms that achieve any rate-point on a uniform discretelattice within the throughput-region (i.e., lattice-throughputoptimal)...
ICDCS
2000
IEEE
14 years 25 days ago
2000
IEEE
Providing up-to-date input to users’ applications is an important data management problem for a distributed computing environment, where each data storage location and intermedi...
PODS
2008
ACM
14 years 8 months ago
2008
ACM
A fundamental problem in distributed computation is the distributed evaluation of functions. The goal is to determine the value of a function over a set of distributed inputs, in ...
JOC
2007
13 years 8 months ago
2007
This paper is about the Oblivious Transfer in the distributed model proposed by M. Naor and B. Pinkas. In this setting a Sender has n secrets and a Receiver is interested in one o...
STOC
2010
ACM
14 years 1 months ago
2010
ACM
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...