5374 search results - page 97 / 1075 » The induction of communication protocols |
161
click to vote
COCO
2008
Springer
2008
Springer
Exponential Separation of Quantum and Classical Non-interactive Multi-party Communication Complexity
15 years 8 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...
143
click to vote
ECSCW
2007
15 years 7 months ago
2007
In computer-mediated group communication, anonymity enables participants to post controversial comments without risking accusations of improper behavior. While this may encourage m...
151
click to vote
IPL
2006
15 years 6 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...
164
click to vote
DAC
2006
ACM
16 years 7 months ago
2006
ACM
A simple protocol for latency-insensitive design is presented. The main features of the protocol are the efficient implementation of elastic communication channels and the automat...
170
click to vote
SCN
2010
Springer
15 years 4 months ago
2010
Springer
We consider a collection of related multiparty computation protocols that provide core operations for secure integer and fixed-point computation. The higher-level protocols offer...