107 search results - page 10 / 22 » A Lower Bound for the Bounded Round Quantum Communication Co... |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We present a new example of a partial boolean function whose one-way quantum communication complexity is exponentially lower than its one-way classical communication complexity. T...
SOFSEM
2010
Springer
14 years 4 months ago
2010
Springer
We extend the lower bound of Adler et. al [1] and Berenbrink [3] for parallel randomized load balancing algorithms. The setting in these asynchronous and distributed algorithms is...
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1}d. We show that a randomised cell probe algorithm that uses polynomial storage and word size...
OPODIS
2008
13 years 9 months ago
2008
We consider wait-free implementations of a regular read/ write register for unauthenticated data using a collection of 3t + k base objects, t of which can be subject to Byzantine ...
STACS
2009
Springer
14 years 2 months ago
2009
Springer
Motivated by the quantum algorithm for testing commutativity of black-box groups (Magniez and Nayak, 2007), we study the following problem: Given a black-box finite ring by an add...