222 search results - page 31 / 45 » Lower Bounds on Quantum Multiparty Communication Complexity |
ESORICS
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. Many theoretical PIR (Private Information Retrieval) constructions have been proposed in the past years. Though information theoretically secure, most of them are impract...
PODC
2009
ACM
14 years 7 months ago
2009
ACM
We define and study the bandwidth determination problem in adhoc P2P environments. Using point-to-point bandwidth probes, the goal is to quickly determine each host's upload ...
JACM
2008
13 years 6 months ago
2008
We consider a failure-free, asynchronous message passing network with n links, where the processors are arranged on a ring or a chain. The processors are identically programmed bu...
ICMCS
1997
IEEE
13 years 11 months ago
1997
IEEE
Quality of Service (QoS) management becomes more and more important, especially in networks where many applications are competing for a limited number of resources. As these appli...
GLOBECOM
2006
IEEE
14 years 23 days ago
2006
IEEE
— We consider a ring topology with limited or full switching capability as deployed in high bandwidth metro optical networks and develop a model to estimate the probability of bl...