<p>Books:</p>

<ul>
<li><p>Eyal Kushilevitz and Noam Nisan, "<a href="http://rads.stackoverflow.com/amzn/click/052102983X">Communication Complexity</a>", 2006.</p></li>
<li><p>Stasys Jukna, "Boolean Function Complexity: Advances and Frontiers", 2012. (Part II of the book is dedicated to Communication Complexity.)</p></li>
</ul>

<p>Articles:</p>

<ul>
<li>Alexander Razborov, "<a href="http://people.cs.uchicago.edu/~razborov/files/cc.pdf">Communication Complexity</a>".</li>
</ul>

<p>Lecture Notes:</p>

<ul>
<li><p>Toni Pitassi, "<a href="http://www.cs.toronto.edu/~toni/Courses/CommComplexity2/CS2429.html">Communication Complexity, Information Complexity and Applications</a>", 2012</p></li>
<li><p>Ran Raz, "<a href="http://www.wisdom.weizmann.ac.il/~ranraz/lecturenotes/">Circuit Complexity and Communication Complexity</a>".</p></li>
</ul>

<p>Also check <a href="http://people.cs.uchicago.edu/~razborov/teaching/index.html">Sasha's remarks about communication complexity</a>.</p>

CC BY-SA 3.0
2014-03-07T01:17:57.337Z
The recent book by Stasys Jukna is fantastic http://www.amazon.com/Boolean-Function-Complexity-Algorithms-Combinatorics/dp/3642245072/ref=sr_1_1?ie=UTF8&qid=1394155008&sr=8-1&keywords=boolean+function+complexity
Marcos Villagra
CC BY-SA 3.0
2014-03-07T11:12:59.670Z
I've also found the old (1990) survey by Lovász useful for its conceptual stance; it is available from his web page at http://www.cs.elte.hu/~lovasz/commcomp.pdf
András Salamon
CC BY-SA 3.0
2014-03-07T22:42:42.943Z
A more recent reference by Lee and Shraibman, also covers the methods to prove lower bound on quantum communication complexity
http://www.research.rutgers.edu/~troyjlee/survey_plain.pdf
pyao
CC BY-SA 3.0
2014-03-07T00:15:49.023Z
2014-03-07T01:57:41.350Z
2014-03-07T01:57:41.350Z
Kaveh
<p>What are some of the best sources (books and papers) to motivate and learn communication complexity on its own and in connection with its relation to computational complexity theory?</p>

<cc.complexity-theory><reference-request><communication-complexity><books>
Best sources for communication complexity
Turbo
# Best sources for communication complexity

(Asked by: username_0 on 2014-03-06)

What are some of the best sources (books and papers) to motivate and learn communication complexity on its own and in connection with its relation to computational complexity theory?

**Tags:** cc.complexity-theory, reference-request, communication-complexity, books

---

## 1 answers

### Answer by username_1 on 2014-03-07. Score: 12 | Accepted answer

Books:

* Eyal Kushilevitz and Noam Nisan, "[Communication Complexity](http://rads.stackoverflow.com/amzn/click/052102983X)", 2006.
* Stasys Jukna, "Boolean Function Complexity: Advances and Frontiers", 2012. (Part II of the book is dedicated to Communication Complexity.)

Articles:

* Alexander Razborov, "[Communication Complexity](http://people.cs.uchicago.edu/~razborov/files/cc.pdf)".

Lecture Notes:

* Toni Pitassi, "[Communication Complexity, Information Complexity and Applications](http://www.cs.toronto.edu/~toni/Courses/CommComplexity2/CS2429.html)", 2012
* Ran Raz, "[Circuit Complexity and Communication Complexity](http://www.wisdom.weizmann.ac.il/~ranraz/lecturenotes/)".

Also check [Sasha's remarks about communication complexity](http://people.cs.uchicago.edu/~razborov/teaching/index.html).

> **Comments:**
> **username_2**: The recent book by Stasys Jukna is fantastic http://www.amazon.com/Boolean-Function-Complexity-Algorithms-Combinatorics/dp/3642245072/ref=sr_1_1?ie=UTF8&qid=1394155008&sr=8-1&keywords=boolean+function+complexity  
> **username_3**: I've also found the old (1990) survey by Lovász useful for its conceptual stance; it is available from his web page at http://www.cs.elte.hu/~lovasz/commcomp.pdf  
> **username_4**: A more recent reference by Lee and Shraibman, also covers the methods to prove lower bound on quantum communication complexity http://www.research.rutgers.edu/~troyjlee/survey_plain.pdf  

---

