Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 217,273,823 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
22 relations
ACM Turing Award
Active networking
Alice and Bob
Complexity
Expand
Broader (2)
Quantum complexity theory
Quantum information science
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
Perfectly-Secure MPC with Linear Communication Complexity
Zuzana Beerliová-Trubíniová
,
M. Hirt
Theory of Cryptography Conference
2008
Corpus ID: 5790469
Secure multi-party computation (MPC) allows a set of n players to securely compute an agreed function, even when up to t players…
Expand
Highly Cited
2002
Highly Cited
2002
An information statistics approach to data stream and communication complexity
Ziv Bar-Yossef
,
T. S. Jayram
,
Ravi Kumar
,
D. Sivakumar
The 43rd Annual IEEE Symposium on Foundations of…
2002
Corpus ID: 9959495
We present a new method for proving strong lower bounds in communication complexity. This method is based on the notion of the…
Expand
Review
1997
Review
1997
Communication Complexity
E. Kushilevitz
Advances in Computing
1997
Corpus ID: 47195834
Highly Cited
1995
Highly Cited
1995
On Randomized One-round Communication Complexity
I. Kremer
,
N. Nisan
,
D. Ron
Symposium on the Theory of Computing
1995
Corpus ID: 14198633
Abstract. We present several results regarding randomized one-round communication complexity. Our results include a connection to…
Expand
Highly Cited
1994
Highly Cited
1994
On data structures and asymmetric communication complexity
Peter Bro Miltersen
,
N. Nisan
,
S. Safra
,
A. Wigderson
Symposium on the Theory of Computing
1994
Corpus ID: 12211028
In this paper we consider two-party communication complexity, the ``asymmetric case'', when the input sizes of the two players…
Expand
Highly Cited
1993
Highly Cited
1993
Quantum Circuit Complexity
A. Yao
IEEE Annual Symposium on Foundations of Computer…
1993
Corpus ID: 2870099
We propose a complexity model of quantum circuits analogous to the standard (acyclic) Boolean circuit model. It is shown that any…
Expand
Highly Cited
1992
Highly Cited
1992
The Probabilistic Communication Complexity of Set Intersection
B. Kalyanasundaram
,
G. Schnitger
SIAM Journal on Discrete Mathematics
1992
Corpus ID: 10139251
It is shown that, for inputs of length n, the probabilistic (bounded error) communication complexity of set intersection is…
Expand
Highly Cited
1992
Highly Cited
1992
Communication complexity of secure computation (extended abstract)
M. Franklin
,
M. Yung
Symposium on the Theory of Computing
1992
Corpus ID: 7486402
A secret-ballot vote for a single proposition is an example of a secure distributed computation. The goal is for <italic>m…
Expand
Highly Cited
1986
Highly Cited
1986
Complexity classes in communication complexity theory
L. Babai
,
P. Frankl
,
Janos Simon
27th Annual Symposium on Foundations of Computer…
1986
Corpus ID: 11870480
We take a complexity theoretic view of A. C. Yao's theory of communication complexity. A rich structure of natural complexity…
Expand
Highly Cited
1985
Highly Cited
1985
Unbiased bits from sources of weak randomness and probabilistic communication complexity
B. Chor
,
Oded Goldreich
26th Annual Symposium on Foundations of Computer…
1985
Corpus ID: 47326627
We introduce a general model for physical sources or weak randomness. Loosely speaking, we view physical sources as devices which…
Expand
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)
ACCEPT & CONTINUE