✦ LIBER ✦

The communication complexity for decentralized evaluation of functions

✍ Scribed by Shyan-Ming Yuan

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 491 KB
Volume: 35
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(90)90021-o

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The unbounded-error communication comple

The unbounded-error communication complexity of symmetric functions

✍ Alexander A. Sherstov 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 370 KB

The communication complexity of computin

The communication complexity of computing differentiable functions in a multicomputer network

✍ Pengyuan Chen 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 742 KB

Harmonic Analysis, Real Approximation, a

Harmonic Analysis, Real Approximation, and the Communication Complexity of Boolean Functions

✍ V. Grolmusz 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 121 KB

Lower Bounds on the Randomized Communica

Lower Bounds on the Randomized Communication Complexity of Read-Once Functions

✍ Nikos Leonardos; Michael Saks 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 583 KB

One-Way Communication Complexity of Comp

One-Way Communication Complexity of Computing a Collection of Rational Functions

✍ Zhi-Quan Luo 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 773 KB

The Communication Complexity of Pointer

The Communication Complexity of Pointer Chasing

✍ Stephen J. Ponzio; Jaikumar Radhakrishnan; S. Venkatesh 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 253 KB

We study the k-round two-party communication complexity of the pointer chasing problem for fixed k. C. Damm, S. Jukna and J. Sgall (1998, Comput. Complexity 7, 109 127) showed an upper bound of O(n log (k&1) n) for this problem. We prove a matching lower bound; this improves the lower bound of 0(n)