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.
Highly Cited
2011
Highly Cited
2011
Property Testing Lower Bounds via Communication Complexity
We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and… 
Highly Cited
2011
Highly Cited
2011
Relationships Between Project Complexity and Communication
The Architecture Engineering Construction (AEC) industry delivers increasingly complex projects to maximize project value. This… 
Highly Cited
2011
Highly Cited
2011
Consensus of linear multi-agent systems with reduced-order observer-based protocols
Highly Cited
2008
Highly Cited
2008
An improved construction of progression-free sets
AbstractThe problem of constructing dense subsets S of {1, 2, ..., n} that contain no three-term arithmetic progression was… 
Highly Cited
2002
Highly Cited
2002
An information statistics approach to data stream and communication complexity
We present a new method for proving strong lower bounds in communication complexity. This method is based on the notion of the… 
Highly Cited
1998
Highly Cited
1998
Communication complexity of group key distribution
Communication complexity has al~vays been an important issue Ivhen designing group key distribution systems. This paper… 
Highly Cited
1998
Highly Cited
1998
Zero-Knowledge Proofs for Finite Field Arithmetic; or: Can Zero-Knowledge be for Free?
We present a general method for constructing commitment schemes based on existence of q-one way group homomorphisms, in which… 
Highly Cited
1994
Highly Cited
1994
On data structures and asymmetric communication complexity
In this paper we consider two-party communication complexity, the ``asymmetric case'', when the input sizes of the two players… 
Highly Cited
1989
Highly Cited
1989
Privacy and communication complexity
  • E. Kushilevitz
  • 30th Annual Symposium on Foundations of Computer…
  • 1989
  • Corpus ID: 22566788
Each of two parties P/sub 1/ and P/sub 2/ holds an n-bit input, x and y, respectively. They wish to compute privately the value… 
Highly Cited
1989
Highly Cited
1989
Using statecharts for hardware description and synthesis
Statecharts have been proposed recently as a visual formalism for the behavioral description of complex systems. They extend… 
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)