50 search results - page 8 / 10 » Languages with Bounded Multiparty Communication Complexity |
144
click to vote
FMOODS
2008
14 years 11 months ago
2008
In this work, novel symbolic step encodings of the transition relation for object based communicating state machines are presented. This class of systems is tailored to capture the...
TCC
2010
Springer
15 years 6 months ago
2010
Springer
Goldreich-Krawczyk (Siam J of Comp’96) showed that only languages in BPP have constant-round public-coin black-box zero-knowledge protocols. We extend their lower bound to “ful...
85
Voted
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
TCC
2009
Springer
15 years 10 months ago
2009
Springer
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
95
Voted
ATAL
2005
Springer
15 years 3 months ago
2005
Springer
We present an integrated approach for reasoning about and learning conversation patterns in multiagent communication. The approach is based on the assumption that information abou...