50 search results - page 5 / 10 » Languages with Bounded Multiparty Communication Complexity |
124
click to vote
STOC
2010
ACM
15 years 8 months ago
2010
ACM
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
250
click to vote
POPL
2008
ACM
16 years 3 months ago
2008
ACM
Communication is becoming one of the central elements in software development. As a potential typed foundation for structured communication-centred programming, session types have...
121
click to vote
ICALP
2003
Springer
15 years 8 months ago
2003
Springer
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
120
click to vote
ICALP
2007
Springer
15 years 9 months ago
2007
Springer
This paper studies the gap between classical one-way communication complexity C(f) and its quantum counterpart Q(f), under the unbounded-error setting, i.e., it is enough that the ...
113
click to vote
COCO
2007
Springer
15 years 9 months ago
2007
Springer
We consider the k-layer pointer jumping problem in the one-way multi-party number-on-the-forehead communication model. Sufficiently strong lower bounds for the problem would have...