Sciweavers

61 search results - page 3 / 13
» Multi-party Quantum Communication Complexity with Routed Mes...
Sort
View
STOC
2006
ACM
149views Algorithms» more  STOC 2006»
14 years 6 months ago
Bounded-error quantum state identification and exponential separations in communication complexity
We consider the problem of bounded-error quantum state identification: given either state 0 or state 1, we are required to output `0', `1' or `?' ("don't ...
Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald d...
CORR
2002
Springer
166views Education» more  CORR 2002»
13 years 5 months ago
Quantum Time-Space Tradeoffs for Sorting
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Hartmut Klauck
SSS
2009
Springer
115views Control Systems» more  SSS 2009»
13 years 10 months ago
How to Improve Snap-Stabilizing Point-to-Point Communication Space Complexity?
A snap-stabilizing protocol, starting from any configuration, always behaves according to its specification. In this paper, we are interested in message forwarding problem in a m...
Alain Cournier, Swan Dubois, Vincent Villain
COCO
2009
Springer
126views Algorithms» more  COCO 2009»
14 years 10 days ago
New Results in the Simultaneous Message Passing Model via Information Theoretic Techniques
—Consider the following Simultaneous Message Passing (SMP) model for computing a relation f ⊆ X ×Y ×Z. In this model Alice, on input x ∈ X and Bob, on input y ∈ Y, send o...
Rahul Jain, Hartmut Klauck
ICCCN
2008
IEEE
14 years 6 days ago
Control Message Reduction Techniques in Backward Learning Ad Hoc Routing Protocols
—Most existing wireless ad hoc routing protocols rely upon the use of backward learning technique with explicit control messages to route packets. In this paper we propose a set ...
Navodaya Garepalli, Kartik Gopalan, Ping Yang