Skip to search formSkip to main contentSkip to account menu

Communication complexity

Known as: Quantum communication complexity 
The notion of communication complexity was introduced by Yao in 1979,who investigated the following problem involving two separated parties (Alice… 
Wikipedia (opens in a new tab)

Related topics

Related topics

22 relations
ACM Turing AwardActive networkingAlice and BobComplexity

Broader (2)

Quantum complexity theoryQuantum information science

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Formal verification and validation of a movement control actor relocation algorithm for safety–critical applications
Wireless sensor and actor networks (WSAN) are captivating significant attention because of their suitability for safety–critical… 
2012
2012
Quantized consensus on first-order integrator networks
2012
2012
Private Stream Search at the same communication cost as a regular search: Role of LDPC codes
Private Stream Search allows users to perform keyword-based queries to a database without revealing any information about the… 
Highly Cited
2009
Highly Cited
2009
Optimal monitoring in multi-channel multi-radio wireless mesh networks
Wireless mesh networks (WMN) are finding increasing usage in city-wide deployments for providing network connectivity. Mesh… 
Review
2004
Review
2004
Measuring Speech Flow of Co-Located and Distributed Command and Control Teams During a Communication Channel Glitch
Team cognition can be observed in the flow of communications among team members. This is shown in the context of a simulated… 
2004
2004
Experimental Analysis of Privacy-Preserving Statistics Computation
The recent investigation of privacy-preserving data mining and other kinds of privacy-preserving distributed computation has been… 
2001
2001
Implementation of a Communications Channelizer using FPGAs and RNS Arithmetic
Field-programmable logic (FPL), often grouped under the popular name field-programmable gate arrays (FPGA), are on the verge of… 
1998
1998
Realizing Common Communication Patterns in Partitioned Optical Passive Stars (POPS) Networks
We consider the problem of realizing several common communication structures in the all-optical Partitioned Optical Passive Stars… 
1992
1992
Hospitality Russian style: Nine communication challenges
1991
1991
Lower Bounds for Depth-Restricted Branching Programs
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)