267 search results - page 4 / 54 » Communication Complexity Under Product and Nonproduct Distri... |
EDO
2000
Springer
13 years 11 months ago
2000
Springer
Developing a distributed application is hard due to the complexity inherent to distributed communication. Moreover, distributed object communication technology is always changing,...
ICALP
2010
Springer
14 years 4 days ago
2010
Springer
A discrete distribution D over Σ1 × · · · × Σn is called (non-uniform) k-wise independent if for any set of k indexes {i1, . . . , ik} and for any z1 ∈ Σi1 , . . . , zk ...
COCO
2008
Springer
13 years 9 months ago
2008
Springer
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
ASIACRYPT
2001
Springer
13 years 12 months ago
2001
Springer
The aim of this article is to propose a fully distributed environment for the RSA scheme. What we have in mind is highly sensitive applications and even if we are ready to pay a pr...
COCO
2009
Springer
13 years 11 months ago
2009
Springer
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...