72 search results - page 10 / 15 » A tight lower bound for restricted pir protocols |
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Despite the apparent similarity between shared randomness and shared entanglement in the context of Communication Complexity, our understanding of the latter is not as good as of ...
PE
2002
Springer
13 years 7 months ago
2002
Springer
Previous analyses of scalable streaming protocols for delivery of stored multimedia have largely focused on how the server bandwidth required for full-file delivery scales as the ...
COCO
2004
Springer
14 years 24 days ago
2004
Springer
We investigate coin-flipping protocols for multiple parties in a quantum broadcast setting: • We propose and motivate a definition for quantum broadcast. Our model of quantum ...
COCOON
2005
Springer
14 years 28 days ago
2005
Springer
This paper gives a quantum algorithm to search in an set S for a k-tuple satisfying some predefined relation, with the promise that some components of a desired k-tuple are in som...
IPL
2006
13 years 7 months ago
2006
We investigate the randomized and quantum communication complexity of the HAMMING DISTANCE problem, which is to determine if the Hamming distance between two n-bit strings is no l...