7133 search results - page 85 / 1427 » Communication algorithms with advice |
IPPS
1998
IEEE
14 years 1 months ago
1998
IEEE
List-based priority schedulers have long been one of the dominant classes of static scheduling algorithms. Such heuristics have been predominantly based around the "critical ...
STOC
1991
ACM
14 years 12 days ago
1991
ACM
The k-round two-party communication complexity was studied in the deterministic model by [14] and [4] and in the probabilistic model by [20] and [6]. We present new lower bounds th...
COCO
2008
Springer
2008
Springer
Exponential Separation of Quantum and Classical Non-interactive Multi-party Communication Complexity
13 years 10 months ago
We give the first exponential separation between quantum and classical multi-party communication complexity in the (non-interactive) one-way and simultaneous message passing setti...
APPT
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. The data redistribution problems on multi-computers had been extensively studied. Irregular data redistribution has been paid attention recently since it can distribute d...
STOC
2001
ACM
14 years 9 months ago
2001
ACM
One of the most intriguing facts about communication using quantum states is that these states cannot be used to transmit more classical bits than the number of qubits used, yet i...