scispace - formally typeset
Search or ask a question
Topic

Communication complexity

About: Communication complexity is a research topic. Over the lifetime, 3870 publications have been published within this topic receiving 105832 citations.


Papers
More filters
Posted Content
TL;DR: In this article, a lower bound of the form Ω(n \cdot k)$ for the set disjointness problem in the message passing model was shown.
Abstract: In a multiparty message-passing model of communication, there are $k$ players. Each player has a private input, and they communicate by sending messages to one another over private channels. While this model has been used extensively in distributed computing and in multiparty computation, lower bounds on communication complexity in this model and related models have been somewhat scarce. In recent work \cite{phillips12,woodruff12,woodruff13}, strong lower bounds of the form $\Omega(n \cdot k)$ were obtained for several functions in the message-passing model; however, a lower bound on the classical Set Disjointness problem remained elusive. In this paper, we prove tight lower bounds of the form $\Omega(n \cdot k)$ for the Set Disjointness problem in the message passing model. Our bounds are obtained by developing information complexity tools in the message-passing model, and then proving an information complexity lower bound for Set Disjointness. As a corollary, we show a tight lower bound for the task allocation problem \cite{DruckerKuhnOshman} via a reduction from Set Disjointness.

74 citations

Book ChapterDOI
28 Mar 2017
TL;DR: This work designs two protocols in the so-called star network topology, where a designated party communicates with everyone else, and takes a new approach of leveraging the 2PC protocol of [FNP04].
Abstract: In this work we study the problem of private set-intersection in the multi-party setting and design two protocols with the following improvements compared to prior work. First, our protocols are designed in the so-called star network topology, where a designated party communicates with everyone else, and take a new approach of leveraging the 2PC protocol of [FNP04]. This approach minimizes the usage of a broadcast channel, where our semi-honest protocol does not make any use of such a channel and all communication is via point-to-point channels. In addition, the communication complexity of our protocols scales with the number of parties.

73 citations

Journal ArticleDOI
01 Nov 1988
TL;DR: In this paper, the authors present algorithms for transposing a matrix embedded in a Boolean n-cube by a binary encoding, a binary-reflected Gray code encoding of rows and columns, or combinations of these two encodings.
Abstract: In a multiprocessor with distributed storage the data structures have a significant impact on the communication complexity. In this paper we present a few algorithms for performing matrix transposition on a Boolean n-cube. One algorithm performs the transpose in a time proportional to the lower bound both with respect to communication start-ups and to element transfer times. We present algorithms for transposing a matrix embedded in the cube by a binary encoding, a binary-reflected Gray code encoding of rows and columns, or combinations of these two encodings. The transposition of a matrix when several matrix elements are identified to a node by consecutive or cyclic partitioning is also considered and lower bound algorithms given. Experimental data are provided for the Intel iPSC and the Connection Machine.

73 citations

Journal ArticleDOI
TL;DR: This work proposes a nonmyopic rule, which is based on not only the target state prediction but also its future tendency, and shows that the variational filtering algorithm is capable of precise tracking even in the highly nonlinear case.
Abstract: The prime motivation of our work is to balance the inherent trade-off between the resource consumption and the accuracy of the target tracking in wireless sensor networks. Toward this objective, the study goes through three phases. First, a cluster-based scheme is exploited. At every sampling instant, only one cluster of sensors that located in the proximity of the target is activated, whereas the other sensors are inactive. To activate the most appropriate cluster, we propose a nonmyopic rule, which is based on not only the target state prediction but also its future tendency. Second, the variational filtering algorithm is capable of precise tracking even in the highly nonlinear case. Furthermore, since the measurement incorporation and the approximation of the filtering distribution are jointly performed by variational calculus, an effective and lossless compression is achieved. The intercluster information exchange is thus reduced to one single Gaussian statistic, dramatically cutting down the resource consumption. Third, a binary proximity observation model is employed by the activated slave sensors to reduce the energy consumption and to minimize the intracluster communication. Finally, the effectiveness of the proposed approach is evaluated and compared with the state-of-the-art algorithms in terms of tracking accuracy, internode communication, and computation complexity.

73 citations

Proceedings ArticleDOI
01 Dec 1985
TL;DR: Santha and Vazirani as discussed by the authors consider a general model for imperfect sources of randomness: the slightly random source, which is a black-box model for randomness.
Abstract: Several computational applications, such as randomizing algorithms [Ra], stochastic simulation [SC, KG] and cryptographic protocols [B11, GM, W] assume a fast source of unbiased, independent coin flips. Unfortunately, the available physical sources of randomness, such as noise diodes and geiger counters are at best imperfect [Mu]. Santha and Vazirani [SV] consider a very general model for such imperfect sources of randomness: the slightly random source. A slightly random source is a black box

73 citations


Network Information
Related Topics (5)
Upper and lower bounds
56.9K papers, 1.1M citations
84% related
Encryption
98.3K papers, 1.4M citations
82% related
Network packet
159.7K papers, 2.2M citations
81% related
Server
79.5K papers, 1.4M citations
81% related
Wireless network
122.5K papers, 2.1M citations
80% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202319
202256
2021161
2020165
2019149
2018141