Join Our Newsletter

Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Pinyin
i2Cantonese
i2Cangjie
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

STOC

1996

ACM

1996

ACM

A linear array network consists of k + 1 processors P0; P1; : : : ; Pk with links only between Pi and Pi+1 0 i k. It is required to compute some boolean function f x; y in this network, where initially x is stored at P0 and y is stored at Pk. Let Dkf be the total number of bits that must be exchanged to compute f in worst case. Clearly, Dkf k Df , where Df is the standard two-party communication complexity of f . Tiwari proved that for almost all functions Dkf kDf ,O1 and conjectured that this is true for all functions. In this paper we disprove Tiwari's conjecture, by exhibiting an in nite family of functions for which Dkf is essentially at most 3 4k Df . Our construction also leads to progress on another major problem in this area: It is easy to bound the two-party communication complexity of any function, given the least number of monochromatic rectangles in any partition of the input space. How tight are such bounds? We exhibit certain functions, for which the two-pa...

Added |
08 Aug 2010 |

Updated |
08 Aug 2010 |

Type |
Conference |

Year |
1996 |

Where |
STOC |

Authors |
Eyal Kushilevitz, Nathan Linial, Rafail Ostrovsky |

Comments (0)