The DOI matches its Crossref record.
Communication Complexity
Abstract
Many aspects of the internal and external workings of computers can be viewed as a series of communication processes. Communication complexity is the mathematical theory of such communication processes. It is also often used as an abstract model of other aspects of computation. This book surveys this mathematical theory, concentrating on the question of how much communication is necessary for any particular process. The first part of the book is devoted to the simple two-party model introduced by Yao in 1979, which is still the most widely studied model. The second part treats newer models developed to deal with more complicated communication processes. Finally, applications of these models, including computer networks, VLSI circuits, and data structures, are treated in the third part of the book. This is an essential resource for graduate students and researchers in theoretical computer science, circuits, networks and information theory.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Advances and Open Problems in Federated Learning
Kairouz, P., & McMahan, H. B. (2021) · Foundations and Trends in Machine Learning · doi:10.1561/2200000083 · Cited by 7,772
Buhrman, H., Cleve, R., Watrous, J., & de Wolf, R. (2001) · Physical Review Letters · doi:10.1103/physrevlett.87.167902 · Cited by 1,190
Nonlocality and communication complexity
Buhrman, H., Cleve, R., Massar, S., & de Wolf, R. (2010) · Reviews of Modern Physics · doi:10.1103/revmodphys.82.665 · Cited by 622
What's hot and what's not: tracking most frequent items dynamically
Cormode, G., & Muthukrishnan, S. (2005) · ACM Transactions on Database Systems · doi:10.1145/1061318.1061325 · Cited by 533
Limit on Nonlocality in Any World in Which Communication Complexity Is Not Trivial
Brassard, G., Buhrman, H., Linden, N., Méthot, A. A., Tapp, A., & Unger, F. (2006) · Physical Review Letters · doi:10.1103/physrevlett.96.250401 · Cited by 404
Metadata
- Authors
- Kushilevitz, E., & Nisan, N.
- Venue
- Cambridge University Press eBooks
- Publisher
- Cambridge University Press
- Published
- 1996-12-28
- OpenAlex
- W605043455
- Cited by
- 477
- References
- 0
- FWCI
- 4.62
- Type
- book
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Communication Complexity. https://app.cochat.ai/papers/10.1017/cbo9780511574948
- The paper
- Kushilevitz, E., & Nisan, N. (1996). Communication Complexity. Cambridge University Press eBooks. https://doi.org/10.1017/cbo9780511574948
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.