Skip to main content

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
Cancel
×
×
Home
  • Home
Communication Complexity
  • Get access
    Buy the print book
    Check if you have access via personal or institutional login
    Log in Register Recommend to librarian
  • Cited by 27
  • Cited by
    Crossref Citations
    Crossref logo
    This (lowercase (translateProductType product.productType)) has been cited by the following publications. This list is generated based on data provided by CrossRef.
    Anshu, Anurag Touchette, Dave Yao, Penghui and Yu, Nengkun 2017. Exponential separation of quantum communication and classical information. p. 277.
    Alon, N Moran, Sh and Yehudayoff, A 2017. Sign rank versus Vapnik-Chervonenkis dimension. Sbornik: Mathematics, Vol. 208, Issue. 12, p. 1724.
    Belovs, Aleksandrs Montoya, J. Andres and Yakaryılmaz, Abuzer 2017. On a Conjecture by Christian Choffrut. International Journal of Foundations of Computer Science, Vol. 28, Issue. 05, p. 483.
    IZUMI, Taisuke 2016. A Concise Tour of Communication Complexity Theory. IEICE ESS Fundamentals Review, Vol. 10, Issue. 1, p. 46.
    Zhao, Yuda Yu, Haifeng and Chen, Binbin 2016. Near-optimal communication-time tradeoff in fault-tolerant computation of aggregate functions. Distributed Computing, Vol. 29, Issue. 1, p. 17.
    Jain, Rahul Pereszlényi, Attila and Yao, Penghui 2016. A Direct Product Theorem for Two-Party Bounded-Round Public-Coin Communication Complexity. Algorithmica, Vol. 76, Issue. 3, p. 720.
    Sun, Yuan Ye, Shiwei Sun, Yi and Kameda, Tsunehiko 2016. Exact and approximate Boolean matrix decomposition with column-use condition. International Journal of Data Science and Analytics, Vol. 1, Issue. 3-4, p. 199.
    Koutis, Ioannis and Williams, Ryan 2016. LIMITS and Applications of Group Algebras for Parameterized Problems. ACM Transactions on Algorithms, Vol. 12, Issue. 3, p. 1.
    Sun, Yuan Ye, Shiwei Sun, Yi and Kameda, Tsunehiko 2015. Improved algorithms for exact and approximate boolean matrix decomposition. p. 1.
    Vyavahare, Pooja Mahzoon, Majid Grover, Pulkit Limaye, Nutan and Manjunath, D. 2014. Information friction limits on computation. p. 93.
    Chen, Binbin Yu, Haifeng Zhao, Yuda and Gibbons, Phillip B. 2014. The Cost of Fault Tolerance in Multi-Party Communication Complexity. Journal of the ACM, Vol. 61, Issue. 3, p. 1.
    Liang, Hongyu 2014. Optimal Collapsing Protocol for Multiparty Pointer Jumping. Theory of Computing Systems, Vol. 54, Issue. 1, p. 13.
    Gomathisankaran, Mahadevan Yuan, Xiaohui and Kamongi, Patrick 2013. Ensure privacy and security in the process of medical image analysis. p. 120.
    Jain, Rahul Pereszlenyi, Attila and Yao, Penghui 2012. A Direct Product Theorem for the Two-Party Bounded-Round Public-Coin Communication Complexity. p. 167.
    Dhulipala, Anand K. Fragouli, Christina and Orlitsky, Alon 2010. Silence-Based Communication. IEEE Transactions on Information Theory, Vol. 56, Issue. 1, p. 350.
    Guha, Sudipto and Huang, Zhiyi 2009. Automata, Languages and Programming. Vol. 5555, Issue. , p. 513.
    Koutis, Ioannis and Williams, Ryan 2009. Automata, Languages and Programming. Vol. 5555, Issue. , p. 653.
    Hu, Nan and Cheung, Sen-ching S. 2007. A New Security Model for Secure Thresholding. p. II-273.
    Dhulipala, Anand K. Fragouli, Christina and Orlitsky, Alon 2007. Single versus multiple rounds for distributed function computation. p. 636.
    Dhulipala, Anand Fragouli, Christina and Orlitsky, Alon 2006. Silence Based Communication for Sensor Networks. p. 212.
    Download full list
    ×
  • Export citation
  • Recommend to librarian
  • Recommend this book

    Email your librarian or administrator to recommend adding this book to your organisation's collection.

    Communication Complexity
    • Online ISBN: 9780511574948
    • Book DOI: https://doi.org/10.1017/CBO9780511574948
    Please enter your name
    Please enter a valid email address
    Who would you like to send this to *

    CAPTCHA *

    Skip to the audio challenge
    ×
  • Buy the print book
Information

Book description

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.

Reviews

‘I strongly recommend this book to everybody interested in this topic.’

Source: Computing Reviews

Refine List
Actions for selected content:
Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Send to Kindle
  • Send to Dropbox
  • Send to Google Drive
    • Send content to

    To send content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about sending content to .

    To send content items to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle.

    Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

    Find out more about the Kindle Personal Document Service.

    Please be advised that item(s) you selected are not available.
    You are about to send
    ×

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×
Contents

Metrics

Altmetric attention score

Full text views

Total number of HTML views: 0
Total number of PDF views: 847 *
Loading metrics...

Book summary page views

Total views: 982 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 13th June 2018. This data will be updated every 24 hours.

Cancel
Confirm
×