24 search results - page 2 / 5 » Separating Deterministic from Randomized Multiparty Communic... |
150
Voted
COCO
2009
Springer
15 years 9 months ago
2009
Springer
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
134
click to vote
SODA
2008
ACM
15 years 3 months ago
2008
ACM
In this paper we consider problems related to the sortedness of a data stream. First we investigate the problem of estimating the distance to monotonicity; given a sequence of len...
102
click to vote
ASIACRYPT
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We give improved upper bounds on the communication complexity of optimally-resilient secure multiparty computation in the cryptographic model. We consider evaluating an n...
114
click to vote
CC
2007
Springer
15 years 2 months ago
2007
Springer
We initiate a study of tradeoffs between communication and computation in well-known communication models and in other related models. The fundamental question we investigate is t...
111
click to vote
COMPGEOM
1997
ACM
15 years 6 months ago
1997
ACM
Given a pair of nonidentical complex objects, de ning and determining how similar they are to each other is a nontrivial problem. In data mining applications, one frequently nee...