# Communication complexity

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2002

Highly Cited

2002

- FOCS
- 2002

We present a new method for proving strong lower bounds in communication complexity. This method is based on the notion of theâ€¦Â (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- 2002

We completely (that is, up to a logarithmic factor) characterize the bounded-error quantum communication complexity of everyâ€¦Â (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- FOCS
- 2001

We prove new lower bounds on quantum bounded error communication complexity. Our methods are based on the Fourier transform ofâ€¦Â (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- IEEE Conference on Computational Complexity
- 2001

The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use ofâ€¦Â (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- SODA
- 1999

We address the problem of minimizing the communication involved in the exchange of similar documents. We consider two users, Aâ€¦Â (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- J. Comput. Syst. Sci.
- 1998

In this paper we consider two party communication complexity when the input sizes of the two players differ significantly, theâ€¦Â (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- Advances in Computers
- 1996

â€¢ Alice and Bob wish to compute f(x,y). â€¢ x known only to Alice, y known only to Bob. â€¢ Goal: minimize #bits exchanged on worstâ€¦Â (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- SIAM J. Comput.
- 1995

In this work we study the direct-sum problem with respect to communication complexity: Consider a relation f deened over f0; 1g nâ€¦Â (More)

Is this relevant?

Highly Cited

1986

Highly Cited

1986

- J. Comput. Syst. Sci.
- 1986

Communication is a bottleneck in many distributed computations. In VLSI, communication constraints dictate lower bounds on theâ€¦Â (More)

Is this relevant?

Highly Cited

1986

Highly Cited

1986

- 27th Annual Symposium on Foundations of Computerâ€¦
- 1986

We take a complexity theoretic view of A. C. Yao's theory of communication complexity. A rich structure of natural complexityâ€¦Â (More)

Is this relevant?